Finite Integer Index of Pathwidth and Treewidth
type: Item
instance of: scholarly article
title: Finite Integer Index of Pathwidth and Treewidth
zbMATH Open document ID: 1456.68129
DOI: 10.1007/978-3-319-13524-3_22
author: Jakub Gajarský
author: Jan Obdržálek
author: Sebastian Ordyniak
author: Felix Reidl
author: Fernando Sánchez Villaamil
author: Somnath Sikdar
author: Peter Rossmanith
published in: Parameterized and Exact Computation
publication date: 2015-09-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 6482363
MaRDI profile type: Publication
full work available at URL: 978-3-319-13524-3 22
OpenAlex ID: W259014925
cites work: An algebraic theory of graph reduction
cites work: (Meta) Kernelization
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Reduction algorithms for graphs of small treewidth
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q3577833
cites work: Bidimensionality and Geometric Graphs
cites work: Kernelization Using Structural Parameters on Sparse Graph Classes
cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
cites work: Sparsity. Graphs, structures, and algorithms
description: scientific article