Abstract
We present a polynomial-time algorithm to find a cycle of length \(\exp(\Omega(\sqrt{\log \ell}))\) in an undirected graph having a cycle of length ≥ ℓ. This is a slight improvement over previously known bounds. In addition the algorithm is more general, since it can similarly approximate the longest circuit, as well as the longest S-circuit (i.e., for S an arbitrary subset of vertices, a circuit that can visit each vertex in S at most once). We also show that any algorithm for approximating the longest cycle can approximate the longest circuit, with a square root reduction in length. For digraphs, we show that the long cycle and long circuit problems have the same approximation ratio up to a constant factor. We also give an algorithm to find a vw-path of length ≥ logn/loglogn if one exists; this is within a loglogn factor of a hardness result.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42, 844–856 (1995)
Bodlaender, H.L.: Minor tests with depth-first search. J. Algorithms 14, 1–23 (1993)
Björklund, A., Husfeldt, T.: Finding a path of superlogarithmic length. SIAM J. Comput. 32, 1395–1402 (2003)
Björklund, A., Husfeldt, T., Khanna, S.: Approximating longest directed paths and cycles. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 222–233. Springer, Heidelberg (2004)
Bazgan, C., Santha, M., Tuza, Z.: On the approximability of finding a(nother) Hamiltonian cycle. In: Proceedings of STACS 1998 (1998)
Chen, G., Xu, J., Yu, X.: Circumference of graphs with bounded degree. SIAM J. Comput. 33, 1136–1170 (2004)
Fellows, M.R., Langston, M.A.: Nonconstructive tools for proving polynomial-time decidability. J. ACM 35, 727–739 (1988)
Fellows, M.R., Langston, M.A.: On search, decision and he efficiency of polynomial-time decidability. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 501–512 (1989)
Feder, T., Motwani, R.: Finding large cycles in Hamiltonian graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, BC, pp. 166–175 (2005)
Feder, T., Motwani, R., Subi, C.: Approximating the longest cycle problem in sparse graphs. SIAM J. Comput. 31, 1596–1607 (2002)
Fürer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 317–324 (1992)
Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. SIAM J. Comput. 36(6), 1648–1671 (2007)
Gabow, H.N., Nie, S.: Finding a long directed cycle. ACM Trans. on Algorithms 4(1) Article 7, 21 pages (2008)
Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135–158 (1973)
Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comp. Sys. Sci. 62(2), 367–375 (2001)
Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica 18, 82–98 (1997)
LaPaugh, A.S., Rivest, R.L.: The subgraph homeomorphism problem. J. Comput. Sys. Sci. 20, 133–149 (1980)
Monien, B.: How to find long paths efficiently. Annals Disc. Math. 25, 239–254 (1985)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. A. Springer, NY (2003)
Vishwanathan, S.: An approximation algorithm for finding a long path in Hamiltonian graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 680–685 (2000)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabow, H.N., Nie, S. (2008). Finding Long Paths, Cycles and Circuits. In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-92182-0_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92181-3
Online ISBN: 978-3-540-92182-0
eBook Packages: Computer ScienceComputer Science (R0)