Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
DOI10.1007/978-3-540-77537-9_29zbMATH Open1137.68475OpenAlexW2002592889MaRDI QIDQ5452232FDOQ5452232
Authors: Giuseppe Di Battista, Fabrizio Frati 
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
Recommendations
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Advances on testing C-planarity of embedded flat clustered graphs
- C-planarity of embedded cyclic c-graphs
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- C-Planarity of C-Connected Clustered Graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (11)
- NodeTrix planarity testing with small clusters
- Computing Maximum C-Planar Subgraphs
- Subexponential-time and FPT algorithms for embedded flat clustered planarity
- C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.
- Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
- Clustered Planarity: Clusters with Few Outgoing Edges
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- C-Planarity of C-Connected Clustered Graphs
- C-planarity of embedded cyclic c-graphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Advances on testing C-planarity of embedded flat clustered graphs
This page was built for publication: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452232)
