Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs

Physical Review Letters

Volumn 86, Issue 8, 2001, Pages 1658-1661

  Weigt, Martin ^a   Hartmann, Alexander K ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY;

BACKTRACKING ALGORITHMS; VERTEX-COVERING ALGORITHMS;

STATISTICAL MECHANICS;

EID: 0034830080     PISSN: 00319007     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevLett.86.1658     Document Type: Article

References (15)

1. Frontiers in Problem Solving: Phase Transitions and Complexity, edited by T. Hogg, B. A. Huberman, and C. Williams, Artificial Intelligence Vol. 81 (I&II) (Elsevier, Amsterdam, 1996).
2. Special issue on Theoretical Computer Science, edited by O. Dubois, R. Monasson, B. Selman, and R. Zecchina [Theor. Comput. Sci. (to be published)].
3. Special issue on Theoretical Computer Science, edited by O. Dubois, R. Monasson, B. Selman, and R. Zecchina [Theor. Comput. Sci. (to be published)].
4. M. R. Garey and D. S. Johnson, Computers and Intractability (Freeman, San Francisco, 1979).
5. R. Monasson and R. Zecchina, Phys. Rev. E 56, 1357 (1997).
6. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Nature (London) 400, 133 (1999).
7. S. Mertens, Phys. Rev. Lett. 81, 4281 (1998).
8. M. Weigt and A. K. Hartmann, Phys. Rev. Lett. 84, 6118 (2000).
9. M. T. Chao and J. Franco, SIAM J. Comput. 15, 1106 (1986).
10. S. Cocco and R. Monasson, preceding Letter, Phys. Rev. Lett. 86, 1654 (2001).
11. B. Bollobas, Random Graphs (Academic Press, New York, 1985).
12. P. G. Gazmuri, Network 14, 367 (1984).
13. A. M. Frieze, Discrete Math. 81, 171 (1990).
14. R. E. Tarjan and A. E. Trojanowski, SIAM J. Comput. 6, 537 (1977).
15. E. L. Lawler and D. E. Wood, Oper. Res. 14, 699 (1966).