Treewidth and Pathwidth Parameterized by the Vertex Cover Number
From MaRDI portal
Publication:2842160
DOI10.1007/978-3-642-40104-6_21zbMath1305.68100OpenAlexW101378340MaRDI QIDQ2842160
Ioan Todinca, Yngve Villanger, Mathieu Liedloff, Mathieu Chapelle
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
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Treewidth and pathwidth parameterized by the vertex cover number ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ Computing the pathwidth of directed graphs with small vertex cover ⋮ Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
This page was built for publication: Treewidth and Pathwidth Parameterized by the Vertex Cover Number
