Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Efficient parallel algorithms for graphs of bounded tree-width
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Graph theory and its applications
Graph theory and its applications
Highly connected sets and the excluded grid theorem
Journal of Combinatorial Theory Series B
A wide-range efficient algorithm for minimal triangulation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for making filled graphs minimal
Theoretical Computer Science
A sufficiently fast algorithm for finding close to optimal clique trees
Artificial Intelligence
A comparison of structural CSP decomposition methods
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
SIAM Journal on Matrix Analysis and Applications
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
Statistics and Computing
Heuristic Algorithms for the Triangulation of Graphs
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Efficient Approximation for Triangulation of Minimum Treewidth
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Minimal Elimination Ordering Inside a Given Chordal Graph
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Maximum Cardinality Search for Computing Minimal Triangulations
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Implementation of a Minimal Triangulation Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)
SIAM Journal on Discrete Mathematics
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Theoretical Computer Science
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Approximation Algorithms for Treewidth
Algorithmica
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A practical algorithm for finding optimal triangulations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Simple and efficient modifications of elimination orderings
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Parameterized Complexity
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Treewidth computations II. Lower bounds
Information and Computation
An experimental evaluation of treewidth at most four reductions
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Automata for monadic second-order model-checking
RP'11 Proceedings of the 5th international conference on Reachability problems
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Finding good decompositions for dynamic programming on dense graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
Evaluating tree-decomposition based algorithms for answer set programming
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Block Local Elimination Algorithms for Sparse Discrete Optimization Problems
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
For more and more applications, it is important to be able to compute the treewidth of a given graph and to find tree decompositions of small width reasonably fast. This paper gives an overview of several upper bound heuristics that have been proposed and tested for the problem of determining the treewidth of a graph and finding tree decompositions. Each of the heuristics produces tree decompositions whose width may be larger than the optimal width. However, experiments show that in many cases, the heuristics give tree decompositions whose width is close to the exact treewidth of the input graphs.