Ultrafast Randomized Parallel Construction- and Approximation Algorithms for Spanning Forests in Dense Graphs

  • Anders Dessmark
  • Carsten Dorgerloh
  • Andrzej Lingas
  • Jürgen Wirtgen
Part of the Combinatorial Optimization book series (COOP, volume 5)


This chapter contains new results, in the form of two algorithms, on the construction of a spanning forest in a dense graph. In this introduction the model of a shared memory Parallel Random Access Machine is described and the spanning forest problem is shortly overviewed. Our new algorithms belong to the so called ultrafast algorithms which we shortly survey in Section 6.2. The denseness property of graphs, which is crucial for our algorithms and very interesting in itself, is discussed in Section 6.3. Our two new algorithms are presented in detail in Section 6.4. An interested reader can find a short list of related open problems at the end of the chapter.


Span Tree Parallel Algorithm Hamiltonian Cycle Dense Graph Span Forest 
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]
    S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In ACM STOC, volume 27, pages 284–293, 1995.Google Scholar
  2. [2]
    Paul Beame and Johan Hastad. Optimal bounds for decision problems on the CRCW PRAM. Journal of the ACM, 36 (3): 643–670, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    Berge. Graphs and Hypergraphs. North-Holland-American Elsevier, New York, 1973.zbMATHGoogle Scholar
  4. [4]
    B. Bollobás. Extremal Graph Theory. Academic Press, London, 1978.zbMATHGoogle Scholar
  5. [5]
    Richard P. Brent. The parallel evaluation of general arithmetic expression. Journal of the ACM, 21 (2): 201–206, 1974.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    Andrei Z. Broder. How hard is to marry at random? (On the approximation of the permanent). In ACM STOC, pages 50–58, 1986.Google Scholar
  7. [7]
    P.Z. Chinn, J. Chvatalova, A.K. Dewdney, and N.E. Gibbs. The bandwidth problem for graphs and matrices - a survey. Journal of Graph Theory, pages 223–254, 1982.Google Scholar
  8. [8]
    Richard Cole. Parallel merge sort. SIAM Journal on Computing, 17 (4): 770–785, 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    E. Dahlhaus and M. Karpinski. Approximation of the permanent for graphs of density less than 1/2 is hard. Manuscript, 1989.Google Scholar
  10. [10]
    Elias Dahlhaus, Peter Hajnal, and Marek Karpinski. On the parallel complexity of hamiltonian cycle and matching problem on dense graphs. Journal of Algorithms, 15: 367–384, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    Elias Dahlhaus and Marek Karpinski. The matching problem for strongly chordal graphs is in NC. Research Report 855-CS, Institut für Informatik der Universität Bonn, 1987.Google Scholar
  12. [12]
    A. Dessmark, C. Dorgerloh, A. Lingas, and J. Wirtgen. Ultrafast randomized parallel construction- and approximation algorithms for spanning forests in dense graphs. In Workshop on Randomized Parallel Computing, volume 3, 1998.Google Scholar
  13. [13]
    J. Diaz, S. Nikoletseas, M. Serna, and P. Spirakis. A genetic approach for the parallel almost-uniform generation and approximate counting of matchings. Technical Report TR-159-87, ALCOM-IT, 1997.Google Scholar
  14. [14]
    G. A. Dirac. Some theorems on abstract graphs. In London Math. Soc., volume 2, pages 69–81, 1952.Google Scholar
  15. [15]
    K. Edward. The complexity of colouring problems on dense graphs. Theoretical Computer Science, 43: 337–343, 1986.MathSciNetCrossRefGoogle Scholar
  16. [16]
    P. Erdös and A. Renyi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5: 17–61, 1960.zbMATHGoogle Scholar
  17. [17]
    W. Fernandez-de-la-Vega, max-cut has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8: 187–199, 1996.MathSciNetzbMATHCrossRefGoogle Scholar
  18. [18]
    F. E. Fich, P. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation. SIAM Journal on Computing, 17 (3): 606–627, 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  19. [19]
    A. Frieze and R. Kannan. The regularity lemma and approximation schemes for dense problems. In IEEE FOCS, volume 37, pages 12–20, 1996.Google Scholar
  20. [20]
    A. Frieze and R. Kannan. Quick approximation to matrices and applications. Manuscript, 1997.Google Scholar
  21. [21]
    H. Gazit. An optimal randomized parallel algorithm for finding connected components in a graph. SIAM Journal on Computing, 20 (6): 1046–1067, 1991.MathSciNetzbMATHCrossRefGoogle Scholar
  22. [22]
    Alan Gibbons and Wojciech Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988.Google Scholar
  23. [23]
    Joseph Gil, Yossi Matias, and Uzi Vishkin. Towards a theory of nearly constant time parallel algorithms. In IEEE FOCS, volume 32, pages 698– 710, 1991.Google Scholar
  24. [24]
    O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. In IEEE FOCS, volume 37, pages 339–348, 1996.Google Scholar
  25. [25]
    Dima Yu. Grigoriev and Marek Karpinski. The matching problem for bipartite graphs with polynomially bounded permanents is in NC. In IEEE FOCS, volume 28, pages 166–172, 1987.Google Scholar
  26. [26]
    Torben Hagerup. Constant-time parallel integer sorting. In ACM STOC, volume 23, pages 299–306, 1991.Google Scholar
  27. [27]
    P. Hajnal. Fast parallel algorithm for finding a hamiltonian cycle in dense graphs. Technical Report 88-003-CS, University of Chicago, 1988.Google Scholar
  28. [28]
    Shay Halperin and Uri Zwick. Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems. In ACM–SIAM SODA, volume 7, pages 438–447, 1996.Google Scholar
  29. [29]
    D. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS Publ. Co., 1997.Google Scholar
  30. [30]
    J. JáJá. An Introduction to Parallel Algorithms. Addison Wesley, 1992.Google Scholar
  31. [31]
    M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43 (2–3): 169–188, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  32. [32]
    M.R. Jerrum and A.J. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18: 1149–1178, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  33. [33]
    R. Kannan. Markov chains and polynomial time algorithms. In ACM STOC, volume 35, pages 656–673, 1994.Google Scholar
  34. [34]
    R. Karp, M. Luby, and M. Madras. Monte-carlo approximation algorithms for enumeration problems. Journal of Algorithms, 18: 429–448, 1989.MathSciNetCrossRefGoogle Scholar
  35. [35]
    Richard M. Karp and Vijaya Ramachandran. A survey of parallel algorithms for shared-memory machines. Research Report UCB/CSD 88/408, University of California, Berkeley, 1988.Google Scholar
  36. [36]
    M. Karpinski, J. Wirtgen, and A. Zelikovsky. An approximation algorithm for the bandwidth problem on dense graphs. In RALCOM, volume 1, 1997.Google Scholar
  37. [37]
    M. Karpinski and A. Zelikovsky. Approximating dense cases of covering problems. In DIMACS Workshop on Network Design: Connectivity and Facilites Location, 1997.Google Scholar
  38. [38]
    Marek Karpinski and Wojciech Rytter. Fast Parallel Algorithms for Graph Matching Problems. Oxford University Press, 1997.Google Scholar
  39. [39]
    L. Lovász. Combinatorial Problems and Exercises. North-Holland, Amsterdam, 1979.zbMATHGoogle Scholar
  40. [40]
    L. Lovasz and M.D. Plummer. Matching Theory. North-Holland, Amsterdam, 1986.zbMATHGoogle Scholar
  41. [41]
    C. McDiarmid. Probability. In L. Beineke and R. Wilson, editors, Graph Connections, chapter 13, pages 194–207. Oxford Science Publications, 1997.Google Scholar
  42. [42]
    Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.Google Scholar
  43. [43]
    Yuval Rabani, Yuri Rabinovich, and Alistair Sinclair. A computational view of population genetics. In ACM STOC, volume 27, pages 83–92, 1995.Google Scholar
  44. [44]
    Yuri Rabinovich, Alistair Sinclair, and Avi Wigderson. Quadratic dynamical systems. In IEEE FOCS, volume 33, 1992.Google Scholar
  45. [45]
    John H. Reif. Synthesis of Parallel Algorithms. Morgan Kaufman Publ. San Mateo, 1993.Google Scholar
  46. [46]
    L. Rudolph and W. Steiger. Subset selection in parallel. In International Conference on Parallel Processing, pages 11–14, 1985.Google Scholar
  47. [47]
    V. Shiloach and U. Vishkin. Finding the maximum, merging and sorting in a parallel computation model. Journal of Algorithms, 2: 88–102, 1981.MathSciNetzbMATHCrossRefGoogle Scholar
  48. [48]
    A. Sinclair. Algorithms For Random Generation And Counting. Progress In Theoretical Computer Science. Birkhäuser, 1993.Google Scholar
  49. [49]
    D. Soroker. Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament. Research Report UCB/CSD 87/309, University of California, Berkeley Bonn, 1986.Google Scholar
  50. [50]
    Seinosuke Toda. On the computational power of PP and ⊕P. In IEEE FOCS, volume 30, pages 514–519, 1990.Google Scholar
  51. [51]
    L. Valiant. Parallelism in comparison problems. SIAM Journal on Computing, 4 (3): 348–355, 1975.MathSciNetzbMATHCrossRefGoogle Scholar
  52. [52]
    L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8: 189–201, 1997.MathSciNetCrossRefGoogle Scholar
  53. [53]
    Vazirani. Rapidly mixing markov chains. In Symposium in Applied Mathematics, American Mathematical Society, volume 44, 1991.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Anders Dessmark
  • Carsten Dorgerloh
  • Andrzej Lingas
  • Jürgen Wirtgen

There are no affiliations available

Personalised recommendations