Planarity-preserving clustering and embedding for large planar graphs
From MaRDI portal
Publication:1869744
DOI10.1016/S0925-7721(02)00094-9zbMATH Open1011.05039MaRDI QIDQ1869744FDOQ1869744
Christian A. Duncan, Stephen G. Kobourov, Michael T. Goodrich
Publication date: 28 April 2003
Published in: Computational Geometry (Search for Journal in Brave)
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
- A new perspective on clustered planarity as a combinatorial embedding problem
- A new perspective on clustered planarity as a combinatorial embedding problem
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
Cited In (9)
- How to draw the minimum cuts of a planar graph
- RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
- \(k\)-plane clustering
- Some Constrained Notions of Planarity
- Title not available (Why is that?)
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)