Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Treewidth and Pathwidth Parameterized by the Vertex Cover Number
verfasst von : Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Erschienen in: Algorithms and Data Structures
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
After the number of vertices,
Vertex Cover Number
is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the
Vertex Cover Number
. Here we consider the
treewidth
and
pathwidth
problems parameterized by
k
, the size of a minimum vertex cover of the input graph. We show that the
pathwidth
and
treewidth
can be computed in
O
*
(3
k
) time. This complements recent polynomial kernel results for
treewidth
and
pathwidth
parameterized by the
Vertex Cover Number
.