Planarity-preserving clustering and embedding for large planar graphs

DOI10.1016/S0925-7721(02)00094-9MaRDI QIDQ1869744zbMATH OpenFDO

Authors Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov

Publication date 28 April 2003

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

algorithmrepresentation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 1500683
• scientific article; zbMATH DE number 2084266
• scientific article; zbMATH DE number 26490
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Planarity for clustered graphs
• On simultaneous planar graph embeddings
• scientific article; zbMATH DE number 1696626
• scientific article; zbMATH DE number 4060744
• A new perspective on clustered planarity as a combinatorial embedding problem
• A new perspective on clustered planarity as a combinatorial embedding problem

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 1500683 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• Bemerkungen zum Vierfarbenproblem
• Convex Maps
• How to draw a planar graph on a grid
• Planarity for clustered graphs

Cited in

(11)

• scientific article; zbMATH DE number 1693473 (Why is no real title available?)
• RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS
• MapSets: visualizing embedded and clustered graphs
• Some Constrained Notions of Planarity
• scientific article; zbMATH DE number 2084266 (Why is no real title available?)
• Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
• \(k\)-plane clustering
• Schematic representation of large biconnected graphs
• Correlation clustering and two-edge-connected augmentation for planar graphs
• scientific article; zbMATH DE number 1500683 (Why is no real title available?)
• How to draw the minimum cuts of a planar graph

This page was built for publication: Planarity-preserving clustering and embedding for large planar graphs

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