Phase transition and finite-size scaling in the vertex-cover problem
type: Item
instance of: scholarly article
title: Phase transition and finite-size scaling in the vertex-cover problem
zbMATH Open document ID: 1196.90103
author: Alexander Hartmann
author: Wolfgang Barthel
author: M. Weigt
published in: Computer Physics Communications
publication date: 2010-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5801509
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: phase transitions
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: j.cpc.2005.03.054
OpenAlex ID: W1971533366
Wikidata QID: Q58001582
cites work: Optimization by Simulated Annealing
cites work: Q4198056
cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions
cites work: Q4237477
cites work: Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
cites work: Q3682518
DOI: 10.1016/J.CPC.2005.03.054
Recommended article: Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
Recommended article: Phase transition and finite-size scaling for the integer partitioning problem
Recommended article: Statistical mechanics of the vertex-cover problem
Recommended article: The phase transition in random regular exact cover
Recommended article: Q5414568
Recommended article: Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Recommended article: Phase coexistence and finite-size scaling in random combinatorial problems
Recommended article: The phase transition in the cluster‐scaled model of a random graph
Recommended article: Phase transitions for the cavity approach to the clique problem on random graphs
description: scientific article; zbMATH DE number 5801509