Planarity-preserving clustering and embedding for large planar graphs

DOI10.1016/S0925-7721(02)00094-9zbMath1011.05039MaRDI QIDQ1869744

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

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)

Related Items (2)

How to draw the minimum cuts of a planar graph ⋮ RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS

Cites Work

• How to draw a planar graph on a grid
• Bemerkungen zum Vierfarbenproblem
• A Separator Theorem for Planar Graphs
• Convex Maps
• Planarity for clustered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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