Minimum size tree-decompositions
From MaRDI portal
Publication:5916057
DOI10.1016/j.dam.2017.01.030zbMath1387.05205OpenAlexW2590602068MaRDI QIDQ5916057
Fatima Zahra Moataz, Nicolas Nisse, Bi Li, Karol Suchan
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.030
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- The complexity of minimum-length path decompositions
- Treewidth computations. II. Lower bounds
- Characterization of partial 3-trees in terms of three structures
- Characterizations of outerplanar graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Algorithms finding tree-decompositions of graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions
- Characterization and Recognition of Partial 3-Trees
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- On Linear Recognition of Tree-Width at Most Four
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Minimum size tree-decompositions
This page was built for publication: Minimum size tree-decompositions
