Processor efficient parallel matching

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 165-170

  Sankowski, Piotr ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Parallel Algorithms; Perfect Matching; Polynomial Matrix Determinant; Processor Efficient; Randomized Algorithms; Rnc

Indexed keywords

PARALLEL MATCHING; PERFECT MATCHING; POLYNOMIAL MATRIX DETERMINANT;

ALGORITHMS; MATRIX ALGEBRA; POLYNOMIALS;

PROGRAM PROCESSORS;

EID: 32144461556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073994     Document Type: Conference Paper

References (22)

1. N. Blum. A new approach to maximum matching in general graphs. In Proc. 17th ICALP, volume 443 of Lecture Notes in Computer Science, pages 586-597. Springer-Verlag, 1990.
2. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 1-6. ACM Press, 1987.
3. J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
4. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for general graph matching problems. J. ACM, 38(4):815-853, 1991.
5. Z. Galil and V. Y. Pan. Improved processor bounds for combinatorial problems in RNC. Combinatorica, 8(2):189-200, 1988.
6. F. R. Gantmacher. The Theory of Matrices, Vol. I, II. Chelsea Publishing Comp., New York, 1959.
7. M. Giesbrecht. "nearly optimal algorithms for canonical matrix forms". SIAM Journal on Computing, 24(5):948-969, 1995.
8. D. Heller, "a survey of parallel algorithms in numerical linear algebra". SIAM Review, 20(4):740-777, Oct. 1978.
9. S.-H. Hou. A simple proof of the Leverrier-Faddeev characteristic polynomial algorithm. SIAM Review, 40:706-709, 1998.
10. E. Kaltofen and V. Pan. 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, pages 180-191. ACM Press, 1991.
11. H. J. Karloff. A Las Vegas RNC algorithm for maximum matching. Combinatorica, 6(4):387-391, 1986.
12. R. M. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in random NC. Combinatorica, 6(1):35-48, 1986.
13. L. Lovász. On determinants, matchings and random algorithms. In L. Budach, editor, Fundamentals of Computation Theory, pages 565-574. Akademie-Verlag, 1979.
14. S. Micali and V. V. Vazirani. An O(√|V||E|) algorithm for finding maximum matching in general graphs. In Proceedings of the twenty first annual IEEE Symposium on Foundations of Computer Science, pages 17-27, 1980.
15. G. L. Miller. Riemann's Hypothesis and Tests for Primality. J. Comput. Syst. Sci., 13(3):300-317, 1976.
16. G. L. Miller. Flow in Planar Graphs with Multiple Sources and Sinks. SIAM J. Comput., 24(5):1002-1017, 1995.
17. M. Mucha and P. Sankowski. Maximum Matchings via Gaussian Elimination. In Proceedings of the 45th annual IEEE Symposium on Foundations of Computer Science, pages 248-255, 2004.
18. K. Mulmuley, U. V. Vazirani, and V. V. Vazirani. Matching is as easy as matrix inversion. In STOC '87: Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 345-354. ACM Press, 1987.
19. M. O. Rabin and V. V. Vazirani. Maximum matchings in general graphs through randomization. Journal of Algorithms, 10:557-567, 1989.
20. J. Schwartz. "fast probabilistic algorithms for verification of polynomial identities". Journal of the ACM, 27:701-717, 1980.
21. A. Storjohann. High-order lifting and integrality certification. J. Symb. Comput., 36(3-4):613-648, 2003.
22. R. Zippel. "probabilistic algorithms for sparse polynomials". In International Symposium on Symbolic and Algebraic Computation, volume 72 of Lecture Notes in Computer Science, pages 216-226, Berlin, 1979. Springer-Verlag.