Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces

DOI10.1007/978-3-540-77537-9_29zbMath1137.68475OpenAlexW2002592889MaRDI QIDQ5452232

Fabrizio Frati, Giuseppe Di Battista

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

\(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Clustered Planarity: Clusters with Few Outgoing Edges ⋮ Computing Maximum C-Planar Subgraphs ⋮ Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

This page was built for publication: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces