Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut is represented by a simple closed curve and vice versa.
We show that the families of cuts that admit a drawing in which every cut is represented by an axis-parallel rectangle are exactly those that have a cactus model that can be rooted such that edges of the graph that cross a cycle of the cactus point to the root. This includes the family of all minimum cuts of a graph. The proof also yields an efficient algorithm to construct a drawing with axis-parallel rectangles if it exists.
- 4.Dinitz, Y., Karzanov, A.V., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Fridman, A. (ed.) Studies in Discrete Optimization, Nauka, pp. 290–306 (1976) (in Russian)Google Scholar
- 5.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. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC 1995), pp. 509–518. ACM, The Association for Computing Machinery, New York (1995)Google Scholar
- 6.Feng, Q., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)Google Scholar
- 8.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
- 9.Lütke-Hüttmann, D.: Knickminimales Zeichnen 4-planarer Clustergraphen. Master’s thesis, Universität des Saarlandes (1999) (Diplomarbeit)Google Scholar