Computational aspects of treewidth for graph
From MaRDI portal
Recommendations
Cites work
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Complexity of Finding Embeddings in a k-Tree
- Computing the treewidth and the minimum fill-in with the modular decomposition
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Heuristic and metaheuristic methods for computing graph treewidth
- On Exact Algorithms for Treewidth
- On treewidth approximations.
- Principles and Practice of Constraint Programming – CP 2004
Cited in
(13)- Treewidth. Computations and approximations
- Special issue: Treewidth
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- The algorithmic theory of treewidth
- On the Threshold of Having a Linear Treewidth in Random Graphs
- Experimental Analysis of Treewidth
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Treewidth of display graphs: bounds, brambles and applications
- scientific article; zbMATH DE number 7678043 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Analytic approximations of statistical quantities and response of noisy oscillators
- The treewidth of line graphs
- On the treewidth of toroidal grids
This page was built for publication: Computational aspects of treewidth for graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150500)
