For planar graphs, the branchwidth can be computed exactly in polynomial time., this in contrast to treewidth for which the complexity on planar graphs is a well known open problem.
The branchwidth can be computed exactly in polynomial time. This was for planar graphs. This in contrast to treewidth for which the complexity on planar graphs is a well known open problem. This was for planar graphs.