Skip to main content
SpringerLink
Log in

Processor Efficient Parallel Matching

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In this paper we consider the problem of finding perfect matchings in parallel. We present a RNC algorithm with almost optimal work with respect to sequential algorithms, i.e., it uses O(n ω) processors, where ω is the matrix multiplication exponent. Our algorithm is based on an RNC algorithm for computing determinant of a degree one polynomial matrix which is of independent interest.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blum, N.: A new approach to maximum matching in general graphs. In: Proc. 17th ICALP. Lecture Notes in Computer Science, vol. 443, pp. 586–597. Springer, Berlin (1990)

    Google Scholar 

  2. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, pp. 1–6. ACM Press (1987)

  3. Edmonds, J.: Paths, trees and flowers. Can. J. Math. 17, 449–467 (1965)

    MATH  MathSciNet  Google Scholar 

  4. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. J. ACM 38(4), 815–853 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Galil, Z., Pan, V.Y.: Improved processor bounds for combinatorial problems in RNC. Combinatorica 8(2), 189–200 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gantmacher, F.R.: The Theory of Matrices, vol. I, II. Chelsea, New York (1959)

    Google Scholar 

  7. Giesbrecht, M.: Nearly optimal algorithms for canonical matrix forms. SIAM J. Comput. 24(5), 948–969 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Heller, D.: A survey of parallel algorithms in numerical linear algebra. SIAM Rev. 20(4), 740–777 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hou, S.-H.: A simple proof of the Leverrier–Faddeev characteristic polynomial algorithm. SIAM Rev. 40, 706–709 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kaltofen, E., Pan, V.: Processor efficient parallel solution of linear systems over an abstract field. In: SPAA ’91: Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 180–191. ACM Press (1991)

  11. Karloff, H.J.: A Las Vegas RNC algorithm for maximum matching. Combinatorica 6(4), 387–391 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  12. Karp, R.M., Upfal, E., Wigderson, A.: Constructing a perfect matching is in random NC. Combinatorica 6(1), 35–48 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lovász, L.: On determinants, matchings and random algorithms. In: L. Budach (ed.) Fundamentals of Computation Theory, pp. 565–574. Akademie (1979)

  14. Micali, S., Vazirani, V.V.: An \(O(\sqrt{|V|}|E|)\) algorithm for finding maximum matching in general graphs. In: Proceedings of the Twenty First Annual IEEE Symposium on Foundations of Computer Science, pp. 17–27 (1980)

  15. Miller, G.L.: Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24(5), 1002–1017 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 248–255 (2004)

  17. Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: STOC ’87: Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, pp. 345–354. ACM Press (1987)

  18. Rabin, M.O., Vazirani, V.V.: Maximum matchings in general graphs through randomization. J. Algorithms 10, 557–567 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  19. Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701–717 (1980)

    Article  MATH  Google Scholar 

  20. Storjohann, A.: High-order lifting and integrality certification. J. Symb. Comput. 36(3-4), 613–648 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  21. Tutte, T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107–111 (1947)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: International Symposium on Symbolic and Algebraic Computation. Lecture Notes in Computer Science, vol. 72, pp. 216–226. Springer, Berlin (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warsaw, Poland

    Piotr Sankowski

Authors
  1. Piotr Sankowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piotr Sankowski.

Additional information

Research supported by KBN grant 1P03A01830.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sankowski, P. Processor Efficient Parallel Matching. Theory Comput Syst 42, 73–90 (2008). https://doi.org/10.1007/s00224-007-9018-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9018-5

Keywords

Search

Navigation