Skip to main content
SpringerLink
Log in

Randomized Parallel Algorithms

  • Chapter
Parallel Processing of Discrete Problems

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 106))

  • 221 Accesses

Abstract

In this paper we show some important randomized techniques for the parallel processing of discrete problems. In particular, we present a few parallel randomized algorithms frequently used for shortest paths problems, matching problems, depth first search and maximum independent set problems. We also discuss the connection between randomization and approximation, showing how randomization yields approximative solutions and we illustrate this connection by means of network flow problems.

This work was supported in part by the Swiss NSF grant 20–47028.96 and by INTAS grant 94–3936.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. N. Alon and J.H. Spencer: The Probabilistic Method Wiley-Interscience Publication, 1992.

    Google Scholar 

  2. A. Aggarwal, R.J. Anderson: A Random MC Algorithm for Depth First Search. Proc. of 19th Annual ACM-STOC, 325–334, 1987.

    Google Scholar 

  3. R.J. Anderson: A parallel algorithm for the maximal path problem. Combinatorica 7(3), 400–415, 1987.

    Google Scholar 

  4. L. Babai, Fortnow L. Levin L and M. Szegedy: Checking computation in polylogarithmic time. Proc. of 23th Annual ACM-STOC 21–28, 1991.

    Google Scholar 

  5. B. Bollobas: Random Graphs. Academic Press, 1985.

    MATH  Google Scholar 

  6. A. Clementi, L. Kucera, J. Rolim: A Note on Parallel Randomized Algorithms for Searching Problems“, to appear in DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences, American Mathematical Society, 1994.

    Google Scholar 

  7. E. Cohen: Polylog-time and near-linear work approximation scheme for undirected shortest paths. Proc. of the 26th Annual ACM-STOC, 16–26, 1994.

    Google Scholar 

  8. D. Coppersmith, P. Raghavan, M. Tompa: Parallel Graph Algorithms that are Efficient on Average. Proc. of 28th Annual IEEE-FOCS, 260–269, 1987.

    Google Scholar 

  9. L. Csanky: Fast Parallel Matrix inversion Algorithms. SIAM J. of Computing 5, 618–623, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  10. P. Erdos and A. Renyi: On Random Graphs I. Publ. Math. Debrecen 6, 290–297, 1959.

    MathSciNet  Google Scholar 

  11. L.R. Ford, D.R. Fulkerson: Flows in Networks Princeton Univ. Press, Princeton, NJ, 1962.

    Google Scholar 

  12. Z. Galil, V. Pan: Improved Processor Bounds for Algebraic and Combinatorial Problems in 1ZNC. 26th Annual IEEE-FOCS, 490–495, 1985.

    Google Scholar 

  13. R.K. Ghosh, G.P. Bhattacharjee: A parallel search algorithm for directed acyclic graphs. BIT 24, 134–150, 1984.

    MathSciNet  MATH  Google Scholar 

  14. R. Greenlaw: Polynomial Completeness and Parallel Computation. in Synthesis of Parallel Algorithms, Ed. J. Reif, Morgan-Kaufmann, 1993.

    Google Scholar 

  15. J. Gil, Y. Matias, U. Vishkin: Towards a theory of nearly constant time parallel algorithms. Pro. of 32th Annual IEEE-FOCS, 698–710, 1991.

    Google Scholar 

  16. J. JâJâ: Parallel Algorithms, Addison-Wesley, 1992.

    Google Scholar 

  17. R.M. Karp, A. Wigderson: A fast parallel algorithm for the maximal independent set problem. JACM, 32, 762–773, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  18. R.M. Karp, E. Upfal, A. Wigderson: Constructing a Maximum Matching is in Random NC. Combinatorica6(1), 35–48, 1986. A preliminary version also appeared in Proc. of 17th Annual ACM-STOC, 1985.

    Google Scholar 

  19. R. Karp and V. Ramachandran, Parallel Algorithms for Shared-Memory Machines. in Handbook of T.C.S, Ed. J. van Leeuwen, Elsevier Science, Vol. A, Chapter 17, 1990.

    Google Scholar 

  20. R. Karp: An introduction to randomized algorithms. Discr App/ Math, 34, 165–201, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  21. P.N. Klein, S. Sairam: A Parallel Randomized Approximation Scheme for Shortest Paths. Proc. of the 24th Annual ACM-STOC, 750–758, 1992.

    Google Scholar 

  22. P.N. Klein, S. Sairam: A linear-processor polylog-time algorithm for shortest paths in planar graphs. Proc. of the 34th Annual IEEE FOCS 259–270, 1994.

    Google Scholar 

  23. D. Kavvadias, G.E. Pantziou, P.G. Spirakis, C. D. Zaroliagis: Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. Proc. of the 19th MFCS, LNCS, 841, 462–472, 1994.

    MathSciNet  Google Scholar 

  24. L. Kutera: Expected behavior of graph coloring algorithms. Proc. of Fundamentals in Computation Theory, LNCS 56, 447–451, 1984.

    Google Scholar 

  25. L. Lovasz: On Determinants, Matchings and Random Algorithm. Fundamentals of Computing Theory, ed. L. Budach, Akademia-Verlag, Berlin, 1979.

    Google Scholar 

  26. M. Luby: A simple parallel algorithm for the maximal independent set problem. SIAM J. on Computing, 15, 1036–1053, 1986. (also in Proc. of 17th Annual ACM-STOC)

    Article  MathSciNet  MATH  Google Scholar 

  27. S. Micali V.V. Vazirani: An O(./jVIIED algorithm for finding maximum matching in general graphs. Proc. of the 21st Annual Symp. on IEEE-FOCS 17–27, 1980.

    Google Scholar 

  28. K. Mulmuley, U.V. Vazirani, V.V Vazirani: Matching is as easy as matrix inversion. Combinatorica 7, 105–113, 1987 (also in Proc. of 19th Annual ACM-STOC, 345–354, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  29. S. Nikoletseas, K. Palem, P. Spirakis, M. Yung: Short Vertex Disjoint paths and Multiconnectivity in Random Graphs: Reliable Networks Computing. Proc. of the 21st ICALP LNCS, 508–519, 1994.

    Google Scholar 

  30. V. Pan: Fast and Efficient Algorithms for the Exact Inversion of Integer Matrices, Fifth Annual Foundations of Software Technology and Theoretical Computer Science Conference, pp. 504–521, 1985.

    Google Scholar 

  31. G. Pantziou, P. Spirakis and C. Zaroliagis: Coloring Random Graphs Efficiently in Parallel, through Adaptive Techniques. CTI TR-90.10.25, Comp. Techn. Institute, Patras. Also presented in the ALCOM Workshop on Graphs Algorithms, Data Structures and Computational Geometry, Berlin, October, 1990.

    Google Scholar 

  32. P. Raghavan, C.D. Thompson: Provably good routing in graphs: regular arrays. Proc. of 17th Annual ACM-STOC, 79–87, 1985.

    Google Scholar 

  33. E. Reghbati, D. Corniel: Parallel computations in graph theory. SIAM J. on Computing 7, 230–237, 1978.

    Article  MATH  Google Scholar 

  34. J. H. Reif: depth first search is inherently sequential. Information processing Letters 20, 229–234, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  35. J.T. Schwartz: Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of ACM 27(4), 701–717, 1980.

    Article  MATH  Google Scholar 

  36. M. Serna, P.G. Spirakis: Tight 7ZNC Approximations to Max Flow. 8th Annual STACS, LNCS 480, 118–126, 1991.

    MathSciNet  Google Scholar 

  37. J. R. Smith: Parallel algorithms for depth first searches I: planar graphs. SIAM J. on Computing 15(3), 814–830, 1986.

    Article  MATH  Google Scholar 

  38. W.T. Tutte: The Factorization of Linear Graphs, J. London Math. Soc. 22, pp. 107–111, 1947.

    Article  MathSciNet  MATH  Google Scholar 

  39. J. Ullmann, M. Yannakakis: High Probability parallel transitive closure algorithms. SIAM J. of Computing 20, 100–125, 1991.

    Article  Google Scholar 

  40. E. Urland: Experimental tests of efficient shortest paths heuristics for random graphs on the CM-2. Techn. Rep 71, University of Geneva, August, 1994.

    Google Scholar 

  41. J. Van Leeuwen: Graph Algorithms, in Handbook of T.C.S Ed. J. van Leeuwen, Elsevier Science, Vol. A, 10, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center Universitaire d’Informatique, University of Geneva, 1204, Geneva, Switzerland

    Jose D. P. Rolim

Authors
  1. Jose D. P. Rolim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Rolim, J.D.P. (1999). Randomized Parallel Algorithms. In: Pardalos, P.M. (eds) Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1492-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1492-2_9

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7165-9

  • Online ISBN: 978-1-4612-1492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation