Characterization and recognition of partial 3-trees
SIAM Journal on Algebraic and Discrete Methods
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Algorithms finding tree-decompositions of graphs
Journal of Algorithms
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
Improved self-reduction algorithms for graphs with bounded treewidth
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Treewidth of chordal bipartite graphs
Journal of Algorithms
Efficient parallel algorithms for graphs of bounded tree-width
Journal of Algorithms
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
On Linear Recognition of Tree-Width at Most Four
SIAM Journal on Discrete Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On treewidth and minimum fill-in of asteroidal triple-free graphs
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
The Structure and Number of Obstructions to Treewidth
SIAM Journal on Discrete Mathematics
Treewidth for graphs with small chordality
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
SIAM Journal on Computing
All structured programs have small tree width and good register allocation
Information and Computation
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
A practical algorithm for making filled graphs minimal
Theoretical Computer Science
A sufficiently fast algorithm for finding close to optimal clique trees
Artificial Intelligence
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
SIAM Journal on Computing
Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
Statistics and Computing
Finding Minimal Forbidden Minors Using a Finite Congruence
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
The Treewidth of Java Programs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A Lower Bound for Treewidth and Its Consequences
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Minimal Elimination Ordering Inside a Given Chordal Graph
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Safe Reduction Rules for Weighted Treewidth
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
A New Lower Bound for Tree-Width Using Maximum Cardinality Search
SIAM Journal on Discrete Mathematics
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
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
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics
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
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Pre-processing for triangulation of probabilistic networks
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
On the maximum cardinality search lower bound for treewidth
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Maximal prime subgraph decomposition of Bayesian networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Parameterized Complexity
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tractable cases of the extended global cardinality constraint
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A backtracking-based algorithm for hypertree decomposition
Journal of Experimental Algorithmics (JEA)
Performance Evaluation of Algorithms for Soft Evidential Update in Bayesian Networks: First Results
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On balanced CSPs with high treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Best-first search for treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Algorithms for propositional model counting
Journal of Discrete Algorithms
Duplicate avoidance in depth-first search with applications to treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
minimum dominating set of queens: A trivial programming exercise?
Discrete Applied Mathematics
Treewidth computations I. Upper bounds
Information and Computation
Minimum fill-in and treewidth of split+ke and split+kv graphs
Discrete Applied Mathematics
Comparative pathway prediction via unified graph modeling of genomic structure information
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Directed nowhere dense classes of graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A branch and bound algorithm for exact, upper, and lower bounds on treewidth
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Tree decompositions of graphs: Saving memory in dynamic programming
Discrete Optimization
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
Reducing problems in unrooted tree compatibility to restricted triangulations of intersection graphs
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
Parameterized complexity of discrete morse theory
Proceedings of the twenty-ninth annual symposium on Computational geometry
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a given graph, and finding a tree decomposition of small width. Both theoretical results, establishing the asymptotic computational complexity of the problem, as experimental work on heuristics (both for upper bounds as for lower bounds), preprocessing, exact algorithms, and postprocessing are discussed.