Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Monien, B.: How to find long paths efficiently. North-Holland Mathematics Studies 109, 239–254 (1985)
Kocay, W., Li, P.-C.: An algorithm for finding a long path in a graph. Utilitas Mathematica 45, 169–185 (1994)
Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95–106. Springer, Heidelberg (2005)
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
Alon, N., Yuster, R., Zwick, U.: Finding and Counting Given Length Cycles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 354–364. Springer, Heidelberg (1994)
Chen, G., Yu, X.: Long cycles in 3-connected graphs. Journal of Combinatorial Theory Series B 86(1), 80–99 (2002)
Bőhme, T., Mohar, B., Thomassen, C.: Long cycles in graphs on a fixed surface. Journal of Combinatorial Theory Series B 85(2), 338–347 (2002)
Chen, G., Gao, Z., Yu, X., Zang, W.: Approximating the Longest Cycle Problem on Graphs with Bounded Degree. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 870–884. Springer, Heidelberg (2005)
Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. SIAM Journal Computer 36, 1648–1671 (2007)
Bilinski, M., Jackson, B., Ma, J., et al.: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. Journal of Combinatorial Theory Series B 101, 214–236 (2011)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this chapter
Cite this chapter
Hou, A., Hao, Z. (2012). An Efficient Algorithm for the Longest Cycle. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25766-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-25766-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25765-0
Online ISBN: 978-3-642-25766-7
eBook Packages: EngineeringEngineering (R0)