Planarity-preserving clustering and embedding for large planar graphs

DOI10.1007/3-540-46648-7_19MaRDI QIDQ4501704zbMATH OpenFDO

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

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46648-7_19

zbMATH Keywords

cluster-based drawingclusteringlayersplanar graphsplanarity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Planarity-preserving clustering and embedding for large planar graphs
• 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
• Computing optimal embeddings for planar graphs
• 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

Cited in

(10)

• Hierarchy of surface models and irreducible triangulations.
• \(k\)-plane clustering
• Planarity-preserving clustering and embedding for large planar graphs
• Tight bounds on maximal and maximum matchings
• Drawing clusters and hierarchies
• scientific article; zbMATH DE number 2084266 (Why is no real title available?)
• Some Constrained Notions of Planarity
• Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
• Schematic representation of large biconnected graphs
• Correlation clustering and two-edge-connected augmentation for planar graphs

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 Q4501704)