How to draw the minimum cuts of a planar graph

Computational Geometry: Theory and Applications

Volumn 29, Issue 2, 2004, Pages 117-133

  Brandes, Ulrik ^a   Cornelsen, Sabine ^a   Fieß, Christian ^b   Wagner, Dorothea ^c  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b SMA und Partner AG   (Switzerland)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

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

Indexed keywords

EID: 4344702381     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.01.008     Document Type: Article

References (26)

1. Brandes U., Eiglsperger M., Kaufmann M., Wagner D. Sketch-driven orthogonal graph drawing. Goodrich M.T., Kobourov S.G. Proceedings of the 10th International Symposium on Graph Drawing (GD 2002). Lecture Notes in Computer Science. vol. 2528:2002;1-11 Springer, Berlin.
2. Bridgeman S., Fanto J., Garg A., Tamassia R., Vismara L. Interactive giotto: An algorithm for interactive orthogonal graph drawing. Di Battista G. Proceedings of the 5th International Symposium on Graph Drawing (GD '97). Lecture Notes in Computer Science. vol. 1353:1998;303-308 Springer, Berlin.
3. S. Cornelsen, D. Wagner, Completely connected clustered graphs, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), submitted for publication.
4. Dahlhaus E. A linear time algorithm to recognize clustered planar graphs and its parallelization. Lucchesi C.L., Moura A.V. Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN '98). Lecture Notes in Computer Science. vol. 1380:1998;239-248 Springer, Berlin.
5. Dinitz Y., Karzanov A.V., Lomonosov M. On the structure of a family of minimal weighted cuts in a graph. Pridman A. Studies in Discrete Optimization. 1976;290-306 Nauka. (in Russian).
6. Dinitz Y., Nutov Z. A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC '95). 1995;509-518 ACM, The Association for Computing Machinery.
7. Duncan C., Goodrich M.T., Kobourov S.G. Planarity-preserving clustering and embedding for large planar graphs. Computational Geometry. 24:(2):2003;95-114.
8. Eades P., Cohen R.F., Feng Q. How to draw a planar clustered graph. Du D.-Z., Li M. Proceedings of the 1st Annual International Conference on Computing and Combinatorics (COCOON '95). Lecture Notes in Computer Science. vol. 959:1995;21-30 Springer, Berlin.
9. Eades P., Feng Q. Multilevel visualization of clustered graphs. North S.C. Proceedings of the 4th International Symposium on Graph Drawing (GD '96). Lecture Notes in Computer Science. vol. 1190:1996;101-112 Springer, Berlin.
10. Eades P., Feng Q., Lin X. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. North S.C. Proceedings of the 4th International Symposium on Graph Drawing (GD '96). Lecture Notes in Computer Science. vol. 1190:1996;146-157 Springer, Berlin.
11. Eades P., Feng Q., Nagamochi H. Drawing clustered graphs on an orthogonal grid. J. Graph Algorithms Appl. 3:(4):1999;3-29.
12. Eades P., Nagamochi H., Feng Q. Straight-line drawing algorithms for hierarchical graphs and clustered graphs, Technical Report 98-03, Department of Computer Science and Software Engineering, University of Newcastle, Australia, 1998. Available at ftp://ftp.cs.newcastle.edu.au/pub/techreports/tr98-03.ps.Z.
13. Feng Q., Cohen R.F., Eades P. Planarity for clustered graphs. Spirakis P. Proceedings of the 3rd European Symposium on Algorithms (ESA '95). Lecture Notes in Computer Science. vol. 979:1995;213-226 Springer, Berlin.
14. Fleischer L. Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. J. Algorithms. 33:(1):1999;51-72.
15. Fößmeier U., Kaufmann M. Drawing high degree graphs with low bend numbers. Brandenburg F.J. Proceedings of the 3rd International Symposium on Graph Drawing (GD '95). Lecture Notes in Computer Science. vol. 1027:1996;254-266 Springer, Berlin.
16. Garg A., Tamassia R. A new minimum cost flow algorithm with applications to graph drawing. North S.C. Proceedings of the 4th International Symposium on Graph Drawing (GD '96). Lecture Notes in Computer Science. vol. 1190:1996;201-213 Springer, Berlin.
17. Gutwenger C., Jünger M., Klau G.W., Leipert S., Mutzel P. Graph drawing algorithm engineering with AGD. Diehl. Software Visualization, International Seminar, Dagstuhl Castle, Germany, May 20-25, 2001. Lecture Notes in Computer Science. vol. 2269:2002;307-323 Springer, Berlin. project home page at http://www.ads.tuwien.ac.at/AGD.
18. Gutwenger C., Jünger M., Leipert S., Mutzel P., Percan M., Weiskircher R. Advances in c-planarity testing of clustered graphs. Goodrich M.T., Kobourov S.G. Proceedings of the 10th International Symposium on Graph Drawing (GD 2002). Lecture Notes in Computer Science. vol. 2528:2002;220-235 Springer, Berlin.
19. Henzinger M.R., Klein P., Rao S., Subramanian S. Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55:1997;3-23. Special Issue on Selected Papers from STOC 1994.
20. Jünger M., Leipert S., Percan M. Triangulating clustered graphs, Technical Report zaik2002-444, Zentrum für Angewandte Informatik Köln, 2002. http://www.zaik.uni-koeln.de/%7Epaper/preprints.html?show=zaik2002-444%.
21. Klau G.W., Mutzel P. Quasi orthogonal drawing of planar graphs, Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1998. Available at http://data.mpi-sb.mpg.de/ internet/reports.nsf.
22. D. Lütke-Hüttmann, Knickminimales Zeichnen 4-planarer Clustergraphen, Master's Thesis, Universität des Saarlandes, 1999 (Diplomarbeit).
23. Moise E.E. Geometric Topology in Dimensions 2 and 3. Graduate Texts in Mathematics. vol. 47:1977;Springer, Berlin.
24. Nagamochi H., Kameda T. Constructing cactus representation for all minimum cuts in an undirected network. J. Oper. Res. Soc. Japan. 39:(2):1996;135-158.
25. Tamassia R. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16:1987;421-444.
26. Tamassia R., Di Battista G., Batini C. Automatic graph drawing and readability of diagrams. IEEE Trans. Systems Man Cybernet. 18:(1):1988;61-79.