scientific article; zbMATH DE number 1500683
From MaRDI portal
Publication:4501704
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
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
- 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
Cited in
(10)- Tight bounds on maximal and maximum matchings
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Hierarchy of surface models and irreducible triangulations.
- scientific article; zbMATH DE number 1693473 (Why is no real title available?)
- scientific article; zbMATH DE number 2084266 (Why is no real title available?)
- Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
- Schematic representation of large biconnected graphs
- \(k\)-plane clustering
- Some Constrained Notions of Planarity
- Planarity-preserving clustering and embedding for large planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501704)
