Phase transition and finite-size scaling in the vertex-cover problem
From MaRDI portal
Publication:709759
DOI10.1016/J.CPC.2005.03.054zbMATH Open1196.90103OpenAlexW1971533366WikidataQ58001582 ScholiaQ58001582MaRDI QIDQ709759FDOQ709759
Authors: Alexander Hartmann, Wolfgang Barthel, M. Weigt 
Publication date: 18 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2005.03.054
Recommendations
- Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
- Phase transition and finite-size scaling for the integer partitioning problem
- Statistical mechanics of the vertex-cover problem
- The phase transition in random regular exact cover
- The phase transition in exact cover
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Phase coexistence and finite-size scaling in random combinatorial problems
- The phase transition in the cluster‐scaled model of a random graph
- Phase transitions for the cavity approach to the clique problem on random graphs
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
Cited In (4)
This page was built for publication: Phase transition and finite-size scaling in the vertex-cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709759)
