An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
Introduction to algorithms
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
SIAM Journal on Computing
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
3-coloring in time O (1.3289n)
Journal of Algorithms
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Enumerating maximal independent sets with applications to graph colouring
Operations Research Letters
Discrete Applied Mathematics
Generation of graphs with bounded branchwidth
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
The branch-width of circular-arc graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques are also the main engine of the fastest so far $\mathcal{O}$(1.9601n)-time exact treewidth algorithm. Based on the recent results of Mazoit, we define the structures that can be regarded as minimal triangulations and potential maximal cliques for branchwidth: efficient triangulations and blocks. We show how blocks can be used to construct an algorithm computing the branchwidth of a graph on n vertices in time (2 + $\sqrt{\rm 3}$)$^{\it n}$ · nO(1).