C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
Abstract For a clustered graph , i.e, a graph whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks whether it is possible to find a planar embedding of the graph and a representation of each cluster as a region homeomorphic to a closed disk such that …