Treewidth and Pathwidth Parameterized by the Vertex Cover Number

DOI10.1007/978-3-642-40104-6_21MaRDI QIDQ2842160zbMATH OpenOpenAlexFDO

Authors Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Publication date 12 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40104-6_21

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Treewidth and pathwidth parameterized by the vertex cover number
• Treedepth Parameterized by Vertex Cover Number.
• Fixed-parameter tractability of treewidth and pathwidth
• Two fixed-parameter algorithms for vertex covering by paths on trees
• On the vertex cover \(P_3\) problem parameterized by treewidth
• On cutwidth parameterized by vertex cover
• On cutwidth parameterized by vertex cover
• The pathwidth and treewidth of cographs
• The Pathwidth and Treewidth of Cographs
• Tree-width and circumference of graphs

Cited in

(6)

• On cutwidth parameterized by vertex cover
• Maximum minimal vertex cover parameterized by vertex cover
• Treewidth and pathwidth parameterized by the vertex cover number
• Treedepth Parameterized by Vertex Cover Number.
• On cutwidth parameterized by vertex cover
• Computing the pathwidth of directed graphs with small vertex cover

This page was built for publication: Treewidth and Pathwidth Parameterized by the Vertex Cover Number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842160)