Approximating the treewidth of AT-free graphs.
From MaRDI portal
Publication:1408810
DOI10.1016/S0166-218X(02)00414-6zbMATH Open1073.68060MaRDI QIDQ1408810FDOQ1408810
Authors: Ioan Todinca, Vincent Bouchitté 
Publication date: 25 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1696522
- Approximability of the path-distance-width for AT-free graphs
- On treewidth approximations.
- scientific article; zbMATH DE number 1262790
- Approximating the path-distance-width for AT-free graphs and graphs in related classes
- On treewidth approximations
- A managed Bayesian risk approach for decision making alternatives
- Approximation algorithms for treewidth
- Approximating Pathwidth for Graphs of Small Treewidth
- scientific article; zbMATH DE number 772777
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- Complexity of Finding Embeddings in a k-Tree
- Graph minors. II. Algorithmic aspects of tree-width
- Network Flow and Testing Graph Connectivity
- Treewidth and minimum fill-in: Grouping the minimal separators
- Treewidth and Pathwidth of Permutation Graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Characterizations and algorithmic applications of chordal graph embeddings
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Approximating the Bandwidth for Asteroidal Triple-Free Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Approximating the treewidth of AT-free graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408810)
