scientific article; zbMATH DE number 7310078
From MaRDI portal
Publication:5150424
zbMath1483.68251MaRDI QIDQ5150424
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm333
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A partial k-arboretum of graphs with bounded treewidth
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
- Treewidth for graphs with small chordality
- Characterizations and algorithmic applications of chordal graph embeddings
- Computing the treewidth and the minimum fill-in with the modular decomposition
- On the structure of a \(k\)-connected graph
- On treewidth approximations.
- Diameter and treewidth in minor-closed graph families
- A characterisation of rigid circuit graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- 10.1007/s11470-008-1012-8
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Algorithmic Aspects of Vertex Elimination on Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- On Exact Algorithms for Treewidth
- Heuristic and metaheuristic methods for computing graph treewidth
- Graph-Theoretic Concepts in Computer Science
- Parallel algorithms for series parallel graphs and graphs with treewidth two
This page was built for publication:
