Between Min Cut and Graph Bisection

  • Dorothea Wagner
  • Frank Wagner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)


We investigate a class of graph partitioning problems whose two extreme representatives are the well-known Min Cut and Graph Bisection problems. The former is known to be efficiently solvable by flow techniques, the latter to be NP-complete. The results presented in this paper are
  • a monotony result of the type“ The more balanced the partition we look for has to be, the harder the problem”.

  • a complexity result clarifying the status of a large part of intermediate problems in the class.

Thus we show the existence and partly localize an“ efficiency border” between the two extremes.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bui, Chaudhuri, Leighton and Sipser]
    T. N. Bui, S. Chaudhuri, F. T. Leighton, M. Sipser: Graph Bisection Algorithms With Good Average Case Behaviour, Combinatorica 7 (1987) 171–191Google Scholar
  2. [Ford and Fulkerson]
    L. R. Ford, D. R. Fulkerson: Maximal Flow Through a Network, Canadian J. Math. 8 (1956) 399–404Google Scholar
  3. [Garey. Johnson and Stockmeyer]
    M. J. Garey, D. S. Johnson, L. Stockmeyer: Some Simplified NP-complete Graph Problems, Theoretical Computer Science 1 (1976) 237–267Google Scholar
  4. [Goldberg and Tarjan]
    A. V. Goldberg, R. E. Tarjan: A New Approach to the Maximum Flow Problem, Journal of the ACM 35 (1988) 921–940Google Scholar
  5. [Hao and Orlin]
    J. Hao, J. B. Orlin: A Faster Algorithm for Finding the Minimum Cut in a Graph, Proceedings of the third ACM-SIAM Symposium on Discrete Algorithms (SODA'91) (1991) 165–174Google Scholar
  6. [Lipton and Tarjan]
    R. J. Lipton, R. E. Tarjan: A Planar Separator Theorem, SIAM J. on Applied Math. 36 (1979) 177–189Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Dorothea Wagner
    • 1
  • Frank Wagner
    • 2
  1. 1.Fachbereich MathematikTechnische Universität BerlinBerlin 12Germany
  2. 2.Institut für Informatik. Fachbereich MathematikFreie Universität BerlinBerlin 33Germany

Personalised recommendations