An Efficient Algorithm for the Longest Cycle
The two important methods of finding undirected longest cycles, namely, the extension + rotation and the branch trimming, both have their own disadvantages. Any undirected basic cycle can always be decomposed into several atomic cycles which are connected with one another by a common edge in a certain order. Along this line, this paper proposes a new efficient algorithm for longest cycles based on the permutation of a finite candidate set of atomic cycles, which is able to reduce the time cost and guarantee the termination. Experimental results on some real cases demonstrate the effectiveness of the proposed algorithm.
KeywordsEfficient Algorithm Adjacent Vertex Common Edge Basic Cycle Longe Cycle
Unable to display preview. Download preview PDF.
- 4.Broersma, H.J., Fomin, F.V., Vant Hof, P., et al.: Exact algorithm for finding longest cycles in claw-free graphs. In: 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) (2009), http://folk.uib.no/pho042/longestcycle.pdf
- 11.Hou, A., Hao, Z.: Sufficient and necessary condition for undirected Hamiltonian graph and its formula. Journal of Computer Engineering and Applications 47(14), 7–10 (2011) (in Chinese)Google Scholar