[PDF][PDF] Computational study on branch decomposition of planar graphs
M Zhu - 2013 - core.ac.uk
The notions of branchwidth and branch-decomposition of graphs are introduced by
Robertson and Seymour and have important algorithmic applications. It is known that many …
Robertson and Seymour and have important algorithmic applications. It is known that many …
[PDF][PDF] Graph decomposition based algorithms for maximum path coloring and connected subgraph problems
M Bashir - 2012 - core.ac.uk
Many application problems in networks can be modeled as optimization problems in a graph
G. For example, the maximum path coloring (Max-PC) problem, described next is an abstract …
G. For example, the maximum path coloring (Max-PC) problem, described next is an abstract …