How to draw the minimum cuts of a planar graph

DOI10.1016/j.comgeo.2004.01.008zbMath1050.05031MaRDI QIDQ1882854

Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner, Christian Fieß

Publication date: 1 October 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-71865

zbMATH Keywords

Graph drawing; Planar graphs; Cactus representation; Clustered graphs; Minimum cuts

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Accelerated Bend Minimization, Completely connected clustered graphs

Cites Work

• Planarity-preserving clustering and embedding for large planar graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Drawing Clustered Graphs on an Orthogonal Grid
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
• Graph-Theoretic Concepts in Computer Science
• Faster shortest-path algorithms for planar graphs
• Planarity for clustered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item