Phase transition and finite-size scaling in the vertex-cover problem

DOI10.1016/j.cpc.2005.03.054zbMath1196.90103OpenAlexW1971533366WikidataQ58001582 ScholiaQ58001582MaRDI QIDQ709759

Wolfgang Barthel, Martin Weigt, Alexander K. Hartmann

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

zbMATH Keywords

combinatorial optimizationphase transitionsNP-complete

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Optimization by Simulated Annealing
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Phase transition and finite-size scaling in the vertex-cover problem