Share Your Research, Maximize Your Social Impacts
Enumeration of Hamiltonian Cycles on a Complete Graph using ECO method
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.3, No. 5)Publication Date: 2014-10-02
Authors : Retno Maharesi;
Page : 29-33
Keywords : enumeration; Hamiltonian cycle; complete graph; generating function;
Source : Download
Find it from : Google Scholar
Abstract
A class of combinatorial objects, namely Hamiltonian cycles in a complete graph of n nodes is constructed based on ECO method. Here, a Hamiltonian cycle is represented as a permutation cycle of length n whose permutation and its corresponding inverse per ...
Other Latest Articles
- A Review of Distributed Multi-Agent Systems Approach to Solve University Course Timetabling Problem
- Diabetes Forecasting Using Supervised Learning Techniques
- Genetic Algorithm Based Energy Efficient Optimization Strategies in Wireless Sensor Networks: A Survey
- Optimized Beamforming for Cognitive Network
- Determination of GPS Coordinate Transformation Parameters of Geodetic Data
Last modified: 2014-10-02 23:37:20