The bisection width of grid graphs
- Cite this article as:
- Papadimitriou, C.H. & Sideri, M. Math. Systems Theory (1996) 29: 97. doi:10.1007/BF01305310
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.