A 5k-vertex kernel for 3-path vertex cover

A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. We give a kernel of 5k vertices for this problem, improvin...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 959; S. 113872
Hauptverfasser:	Xiao, Mingyu, Kou, Shaowei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 30.05.2023
Schlagworte:	3-Path vertex cover Graph algorithms Kernelization Parameterized algorithms Parameterized algorithms 3-Path vertex cover Graph algorithms Kernelization
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. We give a kernel of 5k vertices for this problem, improving the previously known bounds.
ISSN:	0304-3975
DOI:	10.1016/j.tcs.2023.113872