Finite Integer Index of Pathwidth and Treewidth

DOI10.1007/978-3-319-13524-3_22zbMath1456.68129OpenAlexW259014925MaRDI QIDQ2946024

Somnath Sikdar, Jakub Gajarský, Jan Obdržálek, Felix Reidl, Sebastian Ordyniak, Fernando Sánchez Villaamil, Peter Rossmanith

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13524-3_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Reduction algorithms for graphs of small treewidth
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Kernelization Using Structural Parameters on Sparse Graph Classes
• An algebraic theory of graph reduction
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
• (Meta) Kernelization
• Bidimensionality and Geometric Graphs

This page was built for publication: Finite Integer Index of Pathwidth and Treewidth