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

Laforest, Christian; Campigotto, Romain; Angel, Eric

Laforest, Christian; Campigotto, Romain; Angel, Eric (2012), Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs, in Klasing, Ralf, Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Springer, p. 39-50. http://dx.doi.org/10.1007/978-3-642-30850-5_5

Type

Communication / Conférence

Date

2012

Conference title

SEA 2012

Conference date

2012-06

Conference city

Bordeaux

Conference country

France

Book title

Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings

Book author

Klasing, Ralf

Publisher

Springer

Series title

Lecture Notes in Computer Science

Series number

7276/2012

ISBN

978-3-642-30849-9

Pages

39-50

Abstract (EN)

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.

Subjects / Keywords

vertex cover; low memory; huge graphs; experimental analysis; implementation of algorithms