Advertisement

An Efficient Algorithm for the Longest Cycle

  • Aimin Hou
  • Zhifeng Hao
Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 126)

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.

Keywords

Efficient Algorithm Adjacent Vertex Common Edge Basic Cycle Longe Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Monien, B.: How to find long paths efficiently. North-Holland Mathematics Studies 109, 239–254 (1985)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Kocay, W., Li, P.-C.: An algorithm for finding a long path in a graph. Utilitas Mathematica 45, 169–185 (1994)zbMATHMathSciNetGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 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
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Chen, G., Yu, X.: Long cycles in 3-connected graphs. Journal of Combinatorial Theory Series B 86(1), 80–99 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    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)CrossRefMathSciNetGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. SIAM Journal Computer 36, 1648–1671 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 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

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Dongguan University of TechnologyDongguanChina
  2. 2.South China University of TechnologyGuangzhouChina

Personalised recommendations