HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs

Abstract : We present in this paper an experimental study of six heuristics for a well-studied NP-complete graph problem: the vertex cover. These algorithms are adapted to process huge graphs. Indeed, executed on a current laptop computer, they offer reasonable CPU running times (between twenty seconds and eight hours) on graphs for which sizes are between 200 *106 and 100 *109 vertices and edges. We have run algorithms on specific graph families (we propose generators) and also on random power law graphs. Some of these heuristics can produce good solutions. We give here a comparison and an analysis of results obtained on several instances, in terms of quality of solutions and complexity, including running times.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Monday, April 14, 2014 - 5:16:25 PM
Last modification on : Tuesday, January 25, 2022 - 8:30:02 AM
Long-term archiving on: : Monday, July 14, 2014 - 10:36:18 AM


Files produced by the author(s)



Eric Angel, Romain Campigotto, Christian Laforest. Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. 11th International Symposium on Experimental Algorithm (SEA 2012), Jun 2012, Bordeaux, France. pp.39--50, ⟨10.1007/978-3-642-30850-5_5⟩. ⟨hal-00741605⟩



Record views


Files downloads