dc.contributor.author | Laforest, Christian | |
dc.contributor.author | Campigotto, Romain | |
dc.contributor.author | Angel, Eric | |
dc.date.accessioned | 2012-07-16T12:16:20Z | |
dc.date.available | 2012-07-16T12:16:20Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/9753 | |
dc.language.iso | en | en |
dc.subject | vertex cover | en |
dc.subject | low memory | en |
dc.subject | huge graphs | en |
dc.subject | experimental analysis | en |
dc.subject | implementation of algorithms | en |
dc.subject.ddc | 511 | en |
dc.title | Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs | en |
dc.type | Communication / Conférence | |
dc.contributor.editoruniversityother | LIMOS, CNRS UMR 6158, Université Blaise Pascal;France | |
dc.contributor.editoruniversityother | Laboratoire IBISC, EA 4526, Université d’Évry-Val d’Essonne, IBGBI;France | |
dc.description.abstracten | 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. | en |
dc.identifier.citationpages | 39-50 | en |
dc.relation.ispartofseriestitle | Lecture Notes in Computer Science | |
dc.relation.ispartofseriesnumber | 7276/2012 | |
dc.relation.ispartoftitle | Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings | en |
dc.relation.ispartofeditor | Klasing, Ralf | |
dc.relation.ispartofpublname | Springer | en |
dc.relation.ispartofdate | 2012 | |
dc.relation.ispartofurl | http://dx.doi.org/10.1007/978-3-642-30850-5 | en |
dc.description.sponsorshipprivate | oui | en |
dc.subject.ddclabel | Principes généraux des mathématiques | en |
dc.relation.ispartofisbn | 978-3-642-30849-9 | en |
dc.relation.conftitle | SEA 2012 | en |
dc.relation.confdate | 2012-06 | |
dc.relation.confcity | Bordeaux | en |
dc.relation.confcountry | France | en |
dc.identifier.doi | http://dx.doi.org/10.1007/978-3-642-30850-5_5 | |