Clustered Planarity: Clusters with Few Outgoing Edges

DOI10.1007/978-3-642-00219-9_11MaRDI QIDQ3611843zbMATH OpenOpenAlexFDO

Authors Vít Jelínek, Ondřej Suchý, Marek Tesař, Tomáš Vyskočil

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_11

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Planarity for clustered graphs
• Clustered Planarity: Small Clusters in Eulerian Graphs
• scientific article; zbMATH DE number 2084266
• Beyond Clustered Planar Graphs
• Clustered planarity: small clusters in cycles and Eulerian graphs
• Outerplanar and planar oriented cliques
• Clustered planarity = flat clustered planarity
• Graph Drawing
• C-Planarity of C-Connected Clustered Graphs
• Relaxing the constraints of clustered planarity

Cites work

• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• Clustered Planarity: Small Clusters in Eulerian Graphs
• Clustering Cycles into Cycles of Clusters
• Completely connected clustered graphs
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Efficient Planarity Testing
• Graph Drawing
• Planarity for clustered graphs
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Subgraph induced planar connectivity augmentation (extended abstract)

Cited in

(9)

• Straight-line rectangular drawings of clustered graphs
• Clustered planarity = flat clustered planarity
• Relaxing the constraints of clustered planarity
• Beyond Clustered Planar Graphs
• Clustered Planarity with Pipes
• Clustered Planarity: Small Clusters in Eulerian Graphs
• A new perspective on clustered planarity as a combinatorial embedding problem
• Exact algorithms for clustered planarity with linear saturators
• Advances on testing C-planarity of embedded flat clustered graphs

This page was built for publication: Clustered Planarity: Clusters with Few Outgoing Edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611843)