2008 | OriginalPaper | Buchkapitel
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
verfasst von : Giuseppe Di Battista, Fabrizio Frati
Erschienen in: Graph Drawing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Let
C
be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the
c
-planarity of
C
easier than in the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterize
c
-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorithm for such graphs. The results are based on a more general methodology that shades new light on the
c
-planarity testing problem.