How to draw the minimum cuts of a planar graph

DOI10.1016/J.COMGEO.2004.01.008MaRDI QIDQ1882854zbMATH OpenOpenAlexFDO

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

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

Planar graphsGraph drawingCactus representationClustered graphsMinimum cuts

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 2080090
• On the Minimum Cut of Planarizations
• Graph Drawing
• Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles
• scientific article; zbMATH DE number 1187160

Cites work

• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 3544865 (Why is no real title available?)
• scientific article; zbMATH DE number 1263227 (Why is no real title available?)
• scientific article; zbMATH DE number 1974102 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• scientific article; zbMATH DE number 2079638 (Why is no real title available?)
• 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
• Completely connected clustered graphs.
• Drawing Clustered Graphs on an Orthogonal Grid
• Faster shortest-path algorithms for planar graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Planarity for clustered graphs
• Planarity-preserving clustering and embedding for large planar graphs

Cited in

(8)

• Completely connected clustered graphs
• Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles
• Accelerated bend minimization
• scientific article; zbMATH DE number 2044925 (Why is no real title available?)
• scientific article; zbMATH DE number 2080090 (Why is no real title available?)
• On the Minimum Cut of Planarizations
• Graph Drawing
• Angles of arc-polygons and lombardi drawings of cacti

This page was built for publication: How to draw the minimum cuts of a planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1882854)