Characterizing families of cuts that can be represented by axis-parallel rectangles

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

Volumn 2912, Issue , 2004, Pages 357-368

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

^a UNIVERSITY OF PASSAU   (Germany)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS);

AXIS PARALLEL RECTANGLES; CLOSED CURVE; MINIMUM CUT;

GEOMETRY;

EID: 33747791839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_33     Document Type: Article

References (11)

1. U. Brandes, S. Cornelsen, and D. Wagner. How to draw the minimum cuts of a planar graph. In J. Marks, editor, Proceedings of the 8th International Symposium on Graph Drawing (GD 2000), volume 1984 of Lecture Notes in Computer Science, pages 103-114. Springer, 2001.
2. S. Cornelsen and D. Wagner. Completely connected clustered graphs. To appear in Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2003).
3. G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In M. Jünger and P. Mutzel, editors, Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), volume 2265 of Lecture Notes in Computer Science, pages 60-74. Springer, 2002.
4. 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).
5. 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.
6. 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.
7. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD '95), volume 1027 of Lecture Notes in Computer Science, pages 254-266. Springer, 1996.
8. G. W. Klau and P. Mutzel. 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.
9. D. Lütke-Hüttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master's thesis, Universität des Saarlandes, 1999. (Diplomarbeit).
10. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16:421-444, 1987.
11. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 18(l):61-79, 1988.