The bisection width of grid graphs
Rent the article at a discountRent 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.
- M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
- M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete problems,Theoret. Comput. Sci.,1 (1976), 237–267. CrossRef
- A. Itai, C. Papadimitriou, and J. Swarcfiter, Hamilton paths in grid graphs,SIAM J, Comput.,10(4) (1981), 676–686. CrossRef
- 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.
- B. Korte, H. J. Prömel, E. Schwietzke, and A. Steger, Partitioning and Placement in VLSI Layout, Report 88500-OR, Univ. of Bonn, 1988.
- S. Rao, Finding near-optimal separators in planar graphs,Proc. 1987FOCS, pp. 225–237.
- S. Rao, Faster algorithms for finding small edge cuts in planar graphs,Proc. 1992STOC, pp. 229–240.
- The bisection width of grid graphs
Mathematical systems theory
Volume 29, Issue 2 , pp 97-110
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors