Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Tree clustering for constraint networks (research note)
Artificial Intelligence
Introduction to algorithms
Easy problems for tree-decomposable 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
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
CYC: a large-scale investment in knowledge infrastructure
Communications of the ACM
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Does prior knowledge facilitate the development of knowledge-based systems?
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Graph Algorithms
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Optimal decomposition of belief networks
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
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 sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
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
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Rapid protein side-chain packing via tree decomposition
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Treewidth governs the complexity of target set selection
Discrete Optimization
Time and parallelizability results for parity games with bounded treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Imbalance is fixed parameter tractable
Information Processing Letters
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Seymour, and Becker and Geiger that approximate the optimum by factors of 4 and 32/3, respectively. A third algorithm is faster than those but gives an approximation factor of 41/2. The last algorithm is yet faster, producing factor-O(lgk) approximations in polynomial time. Finding triangulations of minimum treewidth for graphs is central to many problems in computer science. Realworld problems in artificial intelligence, VLSI design and databases are efficiently solvable if we have an efficient approximation algorithm for them. We report on experimental results confirming the effectiveness of our algorithms for large graphs associated with real-world problems.