Overlapping Cluster Planarity

Authors

  • Walter Didimo
  • Francesco Giordano
  • Giuseppe Liotta

DOI:

https://doi.org/10.7155/jgaa.00167

Abstract

This paper investigates a new direction in the area of cluster planarity by addressing the following question: Let G be a graph along with a hierarchy of vertex clusters, where clusters can partially intersect. Does G admit a drawing where each cluster is inside a simple closed region, no two edges intersect, and no edge intersects a region twice? We investigate the interplay between this problem and the classical cluster planarity testing problem where clusters are not allowed to partially intersect. Characterizations, models, and algorithms are discussed.

Downloads

Download data is not yet available.

Downloads

Published

2008-10-01

How to Cite

Didimo, W., Giordano, F., & Liotta, G. (2008). Overlapping Cluster Planarity. Journal of Graph Algorithms and Applications, 12(3), 267–291. https://doi.org/10.7155/jgaa.00167