How to draw the minimum cuts of a planar graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 103-114

  Brandes, Ulrik ^a   Cornelsen, Sabine ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CURVE FITTING; DRAWING (GRAPHICS); GRAPH THEORY;

CLOSED CURVE; CLUSTER BOUNDARIES; COMPLETE INFORMATION; HIER-ARCHICAL CLUSTERING; MINIMUM CUT; ORTHOGONAL DRAWINGS; PLANAR DRAWING; PLANAR GRAPH;

GRAPHIC METHODS;

EID: 84958530718     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_10     Document Type: Conference Paper

References (14)

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)
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, 1995.
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
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
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
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
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
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
9. D. Lütke-Hüttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master's thesis, Universit¨at des Saarlandes, 1999. (Diplomarbeit)
10. K. Mehlhorn and S. Näher. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at http://www. mpi-sb.mpg.de/LEDA/
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 http://www.mpi-sb.mpg.de/AGD/
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
13. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16:421-444, 1987
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.