Approximation Algorithms for Treewidth
- 2 April 2008
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 56 (4), 448-479
- https://doi.org/10.1007/s00453-008-9180-4
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Partition-based logical reasoning for first-order and propositional theoriesArtificial Intelligence, 2004
- A sufficiently fast algorithm for finding close to optimal clique treesArtificial Intelligence, 2001
- Treewidth and Minimum Fill-in: Grouping the Minimal SeparatorsSIAM Journal on Computing, 2001
- Treewidth: Algorithmic techniques and resultsPublished by Springer Nature ,1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- Finite automata, bounded treewidth and well-quasiorderingContemporary Mathematics, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Better algorithms for the pathwidth and treewidth of graphsLecture Notes in Computer Science, 1991
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987