Mathematical systems theory

, Volume 29, Issue 2, pp 97–110 | Cite as

The bisection width of grid graphs

  • C. H. Papadimitriou
  • M. Sideri


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.


Planar Graph Boundary Node Hamilton Path Boundary Edge Dual Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [GJ]
    M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.zbMATHGoogle Scholar
  2. [GJS]
    M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete problems,Theoret. Comput. Sci.,1 (1976), 237–267.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [IPS]
    A. Itai, C. Papadimitriou, and J. Swarcfiter, Hamilton paths in grid graphs,SIAM J, Comput.,10(4) (1981), 676–686.CrossRefMathSciNetGoogle Scholar
  4. [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
  5. [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
  6. [R1]
    S. Rao, Finding near-optimal separators in planar graphs,Proc. 1987FOCS, pp. 225–237.Google Scholar
  7. [R2]
    S. Rao, Faster algorithms for finding small edge cuts in planar graphs,Proc. 1992STOC, pp. 229–240.Google Scholar

Copyright information

© Springer-Verlag New York Inc 1996

Authors and Affiliations

  • C. H. Papadimitriou
    • 1
  • M. Sideri
    • 2
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of California at San DiegoLa JollaUSA
  2. 2.Athens University of Economics and BusinessAthensGreece

Personalised recommendations