The bisection width of grid graphs
A solid grid graph is a finite induced subgraph of the infinite grid that has no holes. We present a polynomial algorithm for computing the minimum number of edges we need to delete in order to divide a given solid grid graph into two parts containing an equal number of nodes. The algorithm is based on dynamic programming, and it extends to several related problems, including grid graphs with a bounded number of holes.
KeywordsPlanar Graph Boundary Node Hamilton Path Boundary Edge Dual Graph
Unable to display preview. Download preview PDF.
- [KPS]E. Koutsoupias, C. H. Papadimitriou, and M. Sideri, Optimum bisection of a polygon,Proc. 1990 Computational Geometry Conference. Also,J. Oper. Res. Comput. Sci.,4 (1994), 345–348.Google Scholar
- [KPSS]B. Korte, H. J. Prömel, E. Schwietzke, and A. Steger, Partitioning and Placement in VLSI Layout, Report 88500-OR, Univ. of Bonn, 1988.Google Scholar
- [R1]S. Rao, Finding near-optimal separators in planar graphs,Proc. 1987FOCS, pp. 225–237.Google Scholar
- [R2]S. Rao, Faster algorithms for finding small edge cuts in planar graphs,Proc. 1992STOC, pp. 229–240.Google Scholar