Kernels for the vertex cover problem on the preferred attachment model

Josep Díaz; Jordi Petit; Dimitrios M. Thilikos

doi:10.1007/11764298_21

Kernels for the vertex cover problem on the preferred attachment model

Josep Díaz, Jordi Petit, Dimitrios M. Thilikos

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We examine the behavior of two kernelization techniques for the vertex cover problem viewed as preprocessing algorithms. Specifically, we deal with the kernelization algorithms of Buss and of Nemhauser & Trotter. Our evaluation is applied to random graphs generated under the preferred attachment model, which is usually met in real word applications such as web graphs and others. Our experiments indicate that, in this model, both kernelization algorithms (and, specially, the Nemhauser & Trotter algorithm) reduce considerably the input size of the problem and can serve as very good preprocessing algorithms for vertex cover, on the preferential attachment graphs.

Original language	English (US)
Title of host publication	Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings
Publisher	Springer Verlag
Pages	231-240
Number of pages	10
ISBN (Print)	3540345973, 9783540345978
DOIs	https://doi.org/10.1007/11764298_21
State	Published - 2006
Event	5th International Workshop on Experimental Algorithms, WEA 2006 - Cala Galdana, Menorca, Spain Duration: May 24 2006 → May 27 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4007 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Workshop on Experimental Algorithms, WEA 2006
Country/Territory	Spain
City	Cala Galdana, Menorca
Period	5/24/06 → 5/27/06

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11764298_21

Cite this

Díaz, J., Petit, J., & Thilikos, D. M. (2006). Kernels for the vertex cover problem on the preferred attachment model. In Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings (pp. 231-240). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4007 LNCS). Springer Verlag. https://doi.org/10.1007/11764298_21

Kernels for the vertex cover problem on the preferred attachment model. / Díaz, Josep; Petit, Jordi; Thilikos, Dimitrios M.
Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings. Springer Verlag, 2006. p. 231-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4007 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Díaz, J, Petit, J & Thilikos, DM 2006, Kernels for the vertex cover problem on the preferred attachment model. in Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4007 LNCS, Springer Verlag, pp. 231-240, 5th International Workshop on Experimental Algorithms, WEA 2006, Cala Galdana, Menorca, Spain, 5/24/06. https://doi.org/10.1007/11764298_21

Díaz J, Petit J, Thilikos DM. Kernels for the vertex cover problem on the preferred attachment model. In Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings. Springer Verlag. 2006. p. 231-240. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11764298_21

Díaz, Josep ; Petit, Jordi ; Thilikos, Dimitrios M. / Kernels for the vertex cover problem on the preferred attachment model. Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings. Springer Verlag, 2006. pp. 231-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{be6640c012f44aacbeae486cd794826c,

title = "Kernels for the vertex cover problem on the preferred attachment model",

abstract = "We examine the behavior of two kernelization techniques for the vertex cover problem viewed as preprocessing algorithms. Specifically, we deal with the kernelization algorithms of Buss and of Nemhauser & Trotter. Our evaluation is applied to random graphs generated under the preferred attachment model, which is usually met in real word applications such as web graphs and others. Our experiments indicate that, in this model, both kernelization algorithms (and, specially, the Nemhauser & Trotter algorithm) reduce considerably the input size of the problem and can serve as very good preprocessing algorithms for vertex cover, on the preferential attachment graphs.",

author = "Josep D{\'i}az and Jordi Petit and Thilikos, {Dimitrios M.}",

year = "2006",

doi = "10.1007/11764298_21",

language = "English (US)",

isbn = "3540345973",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "231--240",

booktitle = "Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings",

note = "5th International Workshop on Experimental Algorithms, WEA 2006 ; Conference date: 24-05-2006 Through 27-05-2006",

}

TY - GEN

T1 - Kernels for the vertex cover problem on the preferred attachment model

AU - Díaz, Josep

AU - Petit, Jordi

AU - Thilikos, Dimitrios M.

PY - 2006

Y1 - 2006

N2 - We examine the behavior of two kernelization techniques for the vertex cover problem viewed as preprocessing algorithms. Specifically, we deal with the kernelization algorithms of Buss and of Nemhauser & Trotter. Our evaluation is applied to random graphs generated under the preferred attachment model, which is usually met in real word applications such as web graphs and others. Our experiments indicate that, in this model, both kernelization algorithms (and, specially, the Nemhauser & Trotter algorithm) reduce considerably the input size of the problem and can serve as very good preprocessing algorithms for vertex cover, on the preferential attachment graphs.

AB - We examine the behavior of two kernelization techniques for the vertex cover problem viewed as preprocessing algorithms. Specifically, we deal with the kernelization algorithms of Buss and of Nemhauser & Trotter. Our evaluation is applied to random graphs generated under the preferred attachment model, which is usually met in real word applications such as web graphs and others. Our experiments indicate that, in this model, both kernelization algorithms (and, specially, the Nemhauser & Trotter algorithm) reduce considerably the input size of the problem and can serve as very good preprocessing algorithms for vertex cover, on the preferential attachment graphs.

UR - http://www.scopus.com/inward/record.url?scp=33746069007&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746069007&partnerID=8YFLogxK

U2 - 10.1007/11764298_21

DO - 10.1007/11764298_21

M3 - Conference contribution

AN - SCOPUS:33746069007

SN - 3540345973

SN - 9783540345978

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 231

EP - 240

BT - Experimental Algorithms - 5th International Workshop, WEA 2006, Proceedings

PB - Springer Verlag

T2 - 5th International Workshop on Experimental Algorithms, WEA 2006

Y2 - 24 May 2006 through 27 May 2006

ER -

Kernels for the vertex cover problem on the preferred attachment model

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this