Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
- 20 August 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 265 (1-2) , 199-225
- https://doi.org/10.1016/s0304-3975(01)00163-3
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Load balancing for distributed branch & bound algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Trajectories in Phase Diagrams, Growth Processes, and Computational Complexity: How Search Algorithms Solve the 3-Satisfiability ProblemPhysical Review Letters, 2001
- A variational description of the ground state structure in random satisfiability problemsZeitschrift für Physik B Condensed Matter, 2000
- Phase Transition in the Number Partitioning ProblemPhysical Review Letters, 1998
- A lower bound on the independence number of a graphDiscrete Mathematics, 1998
- On the independence number of random graphsDiscrete Mathematics, 1990
- Mean-field theory of spin-glasses with finite coordination numberPhysical Review Letters, 1987
- Independent sets in random sparse graphsNetworks, 1984
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Branch-and-Bound Methods: A SurveyOperations Research, 1966