Computing branchwidth via Efficient Triangulations and blocks

Minimal triangulations and potential maximal cliques are main ingredients for a number of polynomial time algorithms computing the treewidth for different graph classes. 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 for computing the branchwidth in O*((2 + \sqrt{3})^n) time.