Finding large cycles in Hamiltonian graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 166-175

  Feder, Tomás ^a   Motwani, Rajeev ^b  

^a Stanford University ^*  (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HAMILTONIANS; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; APPROXIMATION RATIO; CONNECTIVITY ALGORITHMS; HAMILTONIAN GRAPHS;

GRAPH THEORY;

EID: 20744459023     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. C. Bazgan, M. Santha, and Z. Tuza. "On the Approximability of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs." Journal of Algorithms 31 (1999), pp. 249-268.
2. A. Björklund and T. Husfeldt, "Finding a path of superlogarithmic length." SIAM Journal on Computing 32-6 (2003), pp. 1395-1402.
3. A. Björklund, T. Husfeldt, and S. Khanna. "Approximating longest directed path." ECCC Report Number 32, 2003. To appear in ICALP (2004).
4. G. Chen, J. Xu, and X. Yu. "Circumference of graphs with bounded degree." Manuscript (2004).
5. T. Feder, R. Motwani, and C. Subi. "Approximating the longest cycle problem in sparse graphs." SIAM Journal on Computing 31-1 (2003), pp. 1596-1607.
6. T. Feder, R. Motwani, and A. Zhu. "k-connected spanning subgraphs of low degree." Manuscript (2004).
7. M. Fürer and B. Raghavachari, "Approximating the minimum degree spaning tree to within one from the optimal degree." In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1992, pp. 317-324.
8. H.N. Gabow. "Finding paths and cycles of superpolylogarithmic length." In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC), 2004, pp. 407-416.
9. J.E. Hopcroft and R.E. Tarjan. "Dividing a graph into triconnected components." SIAM Journal on Computing 2-3 (1973), pp. 135-158.
10. B. Jackson. "Longest cycles in 3-connected cubic graphs." Journal of Combinatorial Theory, Series B 41 (1986), pp. 17-26.
11. B. Jackson and N.C. Wormald. "Longest cycles in 3-connected graphs of bounded maximum degree." In: Graphs, Matrices, and Designs, R.S. Rees (editor), Marcle and Dekker (1993), pp. 237-254.
12. D. Karger, R. Motwani, and G.D.S. Ramkumar. "On approximating the longest path in a graph." Algorithmica 18 (1997), pp. 82-98.
13. A.S. LaPaugh and R.L. Rivest. "The subgraph homeomorphism problem." Journal of Computer and System Sciences 20 (1980), pp. 133-149.
14. R. Ravi, B. Raghavachari, and P. Klein, "Approximation through local optimality: designing networks with small degree." In Proceedings of the 12th Conference on Foundations of Software Tech. and Theoret. Comp. Sci, Lect. Notes in Comp. Sci 652 (1992) pp. 279-290.
15. N. Robertson and P.D. Seymour. "Graph Minors XIII: The disjoint paths problem." Journal of Combinatorial Theory, Series B 63 (1995), pp. 65-110.