, Volume 29, Issue 2, pp 97-110

The bisection width of grid graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

This research was supported by the ESPRIT Basic Research Action No. 3075 ALCOM, a grant to the Universities of Patras and Bonn by the Volkswagen Foundation, and an NSF grant.