Hamiltonian completions of sparse random graphs

Discrete Applied Mathematics

Volumn 152, Issue 1-3, 2005, Pages 139-158

  Gamarnik, David ^a   Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Hamiltonicity; Random graphs; Travelling Salesman Problem

Indexed keywords

EDGE DETECTION; FUNCTIONS; GRAPH THEORY; HAMILTONIANS; PROBABILITY; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

HAMILTONIAN COMPLETION PROBLEM (HCP); HAMILTONICITY; RANDOM GRAPHS; SPARSE GRAPHS;

RANDOM PROCESSES;

EID: 26444511676     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.05.001     Document Type: Article

References (10)

1. A. Agnetis, P. Detti, C. Meloni, and D. Pacciarelli A linear algorithm for the Hamiltonian completion number of the line graph of a tree Inform. Process. Lett. 79 1 2001 17 24
2. J. Beardwood, J.H. Halton, and J.M. Hammersley The shortest path through many points Proc. Camb. Philos. Soc. 55 1959 299 327
3. F.T. Boesch, S. Chen, and J.A.M. McHugh On covering the points of a graph with point disjoint paths R.A. Bari F. Harary Graphs and Combinatorics 1974 Springer Berlin
4. A. Frieze, and J. Yukich Probabilistic analysis of the traveling salesman problem G. Gutin A.P. Punnen The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publisher Dordrecht
5. S.E. Goodman, and S.T. Hedetniemi On the Hamiltonian completion problem R.A. Bari F. Harary Graphs and Combinatorics 1974 Springer Berlin
6. S.E. Goodman, S.T. Hedetniemi, and P.J. Slater Advances on the Hamiltonian completion problem J. ACM 22 3 1975 352 360
7. S. Janson, T. Luczak, and A. Rucinski Random Graphs 2000 Wiley New York
8. J. Komlos, and E. Szemeredi Limit distributions for the existence of Hamilton circuits in a random graph Discrete Math. 43 1983 55 63
9. L. Posa Hamiltonian circuits in random graphs Discrete Math. 14 1976 359 364
10. A. Raychaudhuri The total interval number of a tree and the Hamiltonian completion number of its line graph Inform. Process. Lett. 56 1995 299 306