Skip to main content
SpringerLink
Log in

The bisection width of grid graphs

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.

    MATH  Google Scholar 

  2. M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete problems,Theoret. Comput. Sci.,1 (1976), 237–267.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Itai, C. Papadimitriou, and J. Swarcfiter, Hamilton paths in grid graphs,SIAM J, Comput.,10(4) (1981), 676–686.

    Article  MathSciNet  Google Scholar 

  4. 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.

  5. B. Korte, H. J. Prömel, E. Schwietzke, and A. Steger, Partitioning and Placement in VLSI Layout, Report 88500-OR, Univ. of Bonn, 1988.

  6. S. Rao, Finding near-optimal separators in planar graphs,Proc. 1987FOCS, pp. 225–237.

  7. S. Rao, Faster algorithms for finding small edge cuts in planar graphs,Proc. 1992STOC, pp. 229–240.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of California at San Diego, 92093, La Jolla, CA, USA

    C. H. Papadimitriou

  2. Athens University of Economics and Business, Athens, Greece

    M. Sideri

Authors
  1. C. H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Sideri
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

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.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papadimitriou, C.H., Sideri, M. The bisection width of grid graphs. Math. Systems Theory 29, 97–110 (1996). https://doi.org/10.1007/BF01305310

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01305310

Keywords

Search

Navigation