Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
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
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Algorithms finding tree-decompositions of graphs
Journal of Algorithms
The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
The Structure and Number of Obstructions to Treewidth
SIAM Journal on Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
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
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Efficient Approximation for Triangulation of Minimum Treewidth
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Generalized Coloring for Tree-like Graphs
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
A Lower Bound for Treewidth and Its Consequences
WG '94 Proceedings of the 20th 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
Decomposition Trees: Structured Graph Representation and Efficient Algorithms
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
A New Lower Bound for Tree-Width Using Maximum Cardinality Search
SIAM Journal on Discrete Mathematics
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
Recursively constructed graph families: membership and linear algorithms
Recursively constructed graph families: membership and linear algorithms
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Safe Reduction Rules for Weighted Treewidth
Algorithmica
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
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)
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
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
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Degree-Based treewidth lower bounds
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On the maximum cardinality search lower bound for treewidth
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
The Valve Location Problem in Simple Network Topologies
Graph-Theoretic Concepts in Computer Science
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
The parameterized complexity of the induced matching problem in planar graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Characterization and recognition of digraphs of bounded Kelly-width
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A note on root choice for parallel processing of tree decompositions
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Optimal root choice for parallel processing of tree decompositions
International Journal of Intelligent Information and Database Systems
The Valve Location Problem in Simple Network Topologies
INFORMS Journal on Computing
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Compact navigation and distance oracles for graphs with small treewidth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Pathwidth and searching in parameterized threshold graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Finding good decompositions for dynamic programming on dense graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
A note on the complexity of matching patterns with variables
Information Processing Letters
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.