scientific article; zbMATH DE number 7310138
From MaRDI portal
Publication:5150500
zbMath1483.68252MaRDI QIDQ5150500
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm287
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Computing the treewidth and the minimum fill-in with the modular decomposition
- On treewidth approximations.
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- On Exact Algorithms for Treewidth
- Heuristic and metaheuristic methods for computing graph treewidth
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication:
