Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons

  • Andreas Emil Feldmann
  • Shantanu Das
  • Peter Widmayer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6986)


The graph bisection problem asks to partition the n vertices of a graph into two sets of equal size so that the number of edges across the cut is minimum. We study finite, connected subgraphs of the infinite two-dimensional grid that do not have holes. Since bisection is an intricate problem, our interest is in the tradeoff between runtime and solution quality that we get by limiting ourselves to a special type of cut, namely cuts with at most one bend each (corner cuts). We prove that optimum corner cuts get us arbitrarily close to equal sized parts, and that this limitation makes us lose only a constant factor in the quality of the solution. We obtain our result by a thorough study of cuts in polygons and the effect of limiting these to corner cuts.


Planar Graph Grid Line Dual Graph Simple Polygon Simple Cycle 
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. 1.
    Arbenz, P., Müller, R.: Microstructural finite element analysis of human bone structures. ERCIM News 74, 31–32 (2008)Google Scholar
  2. 2.
    Díaz, J., Serna, M.J., Torán, J.: Parallel approximation schemes for problems on planar graphs. Acta Informatica 33(4), 387–408 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Feldmann, A.E., Das, S., Widmayer, P.: Simple Cuts are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol. 6508, pp. 11–20. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Feldmann, A.E., Das, S., Widmayer, P.: Restricted cuts for bisections in solid grids: A proof via polygons. Technical Report 731, Institute of Theoretical Computer Science, ETH Zürich (July 2011)Google Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-completeness. W.H. Freeman and Co., San Fransisco (1979)zbMATHGoogle Scholar
  6. 6.
    Goldberg, M., Miller, Z.: A parallel algorithm for bisection width in trees. Computers & Mathematics with Applications 15(4), 259–266 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    MacGregor, R.M.: On partitioning a graph: a theoretical and empirical study. PhD thesis, University of California, Berkeley (1978)Google Scholar
  8. 8.
    Papadimitriou, C., Sideri, M.: The bisection width of grid graphs. Theory of Computing Systems 29, 97–110 (1996)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Andreas Emil Feldmann
    • 1
  • Shantanu Das
    • 2
  • Peter Widmayer
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZürichSwitzerland
  2. 2.Laboratoire d’Informatique FondamentaleAix-Marseille UniversityFrance

Personalised recommendations