Communication-efficient parallel multiway and approximate minimum cut computation

  • Friedhelm Meyer auf der Heide
  • Gabriel Terán Martinez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1380)


We examine different variants of minimum cut problems on undirected weighted graphs on the p-processor bulk synchronous parallel (BSP) model of Valiant. This model and the corresponding cost measure guide algorithm designers to develop work efficient algorithms that need only very little communication. Karger and Stein have presented a recursive contraction algorithm to solve minimum cut problems. They suggest a PRAM implementation of their algorithm working in polynomial polylogarithmic time, but being not work-optimal. Typically the problem size n is much larger than the number of processors p on real-world parallel computers (pn). For this setting we present improved BSP implementations of the algorithm of Karger and Stein. For the case of multiway cut and approximate minimum cut we obtain optimal, communication efficient results. A nice effect, beside the optimality, is that communication is efficient for a large spectrum of BSP-parameters. In the case of the minimal cut problem our results are close to optimal.


Computation Tree Bulk Synchronous Parallel Undirected Weighted Graph Communication Volume Parallel Random Access Machine 
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.
    M. Adler, J. W. Byers, R. M. Karp, Parallel sorting with limited bandwidth, SPAA 95, pages 129–136, 1995.Google Scholar
  2. 2.
    A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model, ESA 95, 1995.Google Scholar
  3. 3.
    E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N.Santoro, S. W. Song, Efficient parallel graph algorithms for coarse grained multicomputers and BSP, ICALP 97, Bologna, Italy, 1997.Google Scholar
  4. 4.
    D. E. Culler, R. M. Karp, D. A. Peterson, A. Sahay, K. E. Schauser, E. Santos, R.Subramonian, T. von Eicken, Log P: Towards a realistic model of parallel computation, in Proc. 4th ACM SIGPLAN Symp. on Princ. and Practice of Parallel Programming, pages 1–12, 1993.Google Scholar
  5. 5.
    A. V. Gerbessiotis L. G. Valiant, Direct bulk-synchronous parallel algorithms, J. of Parallel and Distributed Computing, 22:251–267, 1994.CrossRefGoogle Scholar
  6. 6.
    M. T. Goodrich, Communication-efficient parallel sorting, STOC 96, 1996.Google Scholar
  7. 7.
    M. T. Goodrich, Randomized fully-scalable BSP techniques for multisearching and convex hull construction, SODA 97, 1997.Google Scholar
  8. 8.
    J. Jájá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, Mass., 1992.Google Scholar
  9. 9.
    D. R. Karger, Global min-cuts in RNC and other ramifications of a simple mincut algorithm, SODA 93, pages 21–30, 1993.Google Scholar
  10. 10.
    D. R. Karger, Random Sampling in Graph Optimization Problems, PhD thesis, Stanford University, 1994.Google Scholar
  11. 11.
    D. R. Karger, Minimum cuts in near-linear time, STOC 96, pages 56–63, 996.Google Scholar
  12. 12.
    D. R. Karger, A randomized fully polynomial approximation scheme for the all terminal network reliability problem, STOC 95, pages 11–17, 1995.Google Scholar
  13. 13.
    D. R. Karger, C. Stein, A new approach to the minimum cut problem, Journal of the ACM, 43(4):601–640, 1996.MathSciNetCrossRefGoogle Scholar
  14. 14.
    Y. Mansour, N. Nisan, U. Vishkin, Trade-offs between communication throughput and parallel time STOC 94, pages 372–381, 1994.Google Scholar
  15. 15.
    D. W. Matula, A linear 2+ε approximation algorithm for edge connectivity, SODA 93, pages 500–504, 1993.Google Scholar
  16. 16.
    H. Nagamochi, T. Ibaraki, Computing edge connectivity in multigraphs and capacitated graphs, SIAM J. of Discrete Mathematics, 5:54–66, 1992.MathSciNetCrossRefGoogle Scholar
  17. 17.
    C. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, STOC 98, pages 510–513, 1988.Google Scholar
  18. 18.
    J. H. Reif, Synthesis or Parallel Algorithms, Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1993.Google Scholar
  19. 19.
    M. Stoer, F. Wagner, A simple min cut algorithm, ESA 94, page 141–147, 1994.Google Scholar
  20. 20.
    L. G. Valiant, A bridging model for parallel computation, Comm. ACM,33:103–lll, 1990.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  • Gabriel Terán Martinez
    • 1
  1. 1.Heinz Nixdorf Institute and Department of Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations