arXiv · cond-mat/0009417
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
Abstract
In this letter, we analytically describe the typical solution time needed by a backtracking algorithm to solve the vertex-cover problem on finite-connectivity random graphs. We find two different transitions: The first one is algorithm-dependent and marks the dynamical transition from linear to exponential solution times. The second one gives the maximum computational complexity, and is found exactly at the threshold where the system undergoes an algorithm-independent phase transition in its solvability. Analytical results are corroborated by numerical simulations.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Martin Weigt, Alexander K. Hartmann. 2000-11-28. Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. https://doi.org/10.1103/physrevlett.86.1658
Cite the original work for its findings. Save a collection to share your selection of sources.