How to Draw the Minimum Cuts of a Planar Graph

Extended Abstract
  • Ulrik Brandes
  • Sabine Cornelsen
  • Dorothea Wagner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)


We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. We present an algorithm for c-planar orthogonal drawings of hierarchically clustered planar graphs with rectangularly shaped cluster boundaries and the minimum number of bends. This approach is then extended to drawings in which the two vertex subsets of every minimum cut are separated by a simple closed curve.


Planar Graph Weighted Graph Boundary Edge Cyclic Order Simple Closed Curve 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Y. Dinitz, A. V. Karzanov, and M. Lomonosov. On the structure of a family of minimal weighted cuts in a graph. In A. Fridman, editor, Studies in Discrete Optimization, pages 290–306. Nauka, 1976. (in Russian).Google Scholar
  2. 2.
    Y. Dinitz and Z. Nutov. A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC’ 95), pages 509–518. ACM, The Association for Computing Machinery, 199Google Scholar
  3. 3.
    P. Eades, Q. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal on Graph Algorithms and Applications,3(4):3–29, 1999.zbMATHMathSciNetGoogle Scholar
  4. 4.
    Q. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Proceedings of the 3rd European Symposium on Algorithms (ESA’ 95), volume 979 of Lecture Notes in Computer Science, pages 213–226. Springer, 1995.Google Scholar
  5. 5.
    L. Fleischer. Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. Journal of Algorithms, 33(1):51–72, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In S. C. North, editor, Proceedings of the 4th International Symposium on Graph Drawing (GD’ 96), volume 1190 of Lecture Notes in Computer Science, pages 201–213. Springer, 1996.Google Scholar
  7. 7.
    M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55:3–23, 1997. Special Issue on Selected Papers from STOC 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    G. W. Klau and P. Mutzel. Quasi orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-031, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1998.Google Scholar
  9. 9.
    D. Lütke-Hüttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master’s thesis, Universität des Saarlandes, 1999. (Diplomarbeit).Google Scholar
  10. 10.
    K. Mehlhorn and S. Näher. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at
  11. 11.
    P. Mutzel, C. Gutwenger, R. Brockenauer, S. Fialko, G. W. Klau, M. Krüger, T. Ziegler, S. Näher, D. Alberts, D. Ambras, G. Koch, M. Jünger, C. Buchheim, and S. Leipert. A library of algorithms for graph drawing. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD’ 98), volume 1547 of Lecture Notes in Computer Science, pages 456–457. Springer, 1998. Project home page at Scholar
  12. 12.
    H. Nagamochi and T. Kameda. Constructing cactus representation for all minimum cuts in an undirected network. Journal of the Operations Research, 39(2):135–158, 1996.zbMATHMathSciNetGoogle Scholar
  13. 13.
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16:421–444, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 18(1):61–79, 1988.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ulrik Brandes
    • 1
  • Sabine Cornelsen
    • 1
  • Dorothea Wagner
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of KonstanzGermany

Personalised recommendations