Maximum matchings via Gaussian elimination

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 248-255

  Mucha, Marcin ^a   Sankowski, Piotr ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

BIPARTITE ALGORITHM; BIPARTITE MATCHING ALGORITHM; MATRIX MULTIPLICATION; MAXIMUM MATCHINGS;

COMPUTATIONAL COMPLEXITY;

EID: 17744374132     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms.
2. 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.
3. J. Bunch and J. Hopcroft. Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation, 28(125):231-236, 1974.
4. J. Cheriyan. Randomized Õ(M(|V|)) algorithms for problems in matching theory. SIAM Journal on Computing, 26(6): 1635-1655, 1997.
5. 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.
6. J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
7. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for general graph matching problems. J. ACM, 38(4):815-853, 1991.
8. J. Hohn, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48(4):723-760, 2001.
9. O. H. Ibarra and S. Moran. Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication. Inf. Process. Lett., 13(1):12-15, 1981.
10. L. Lovász. On determinants, matchings and random algorithms. In L. Budach, editor, Fundamentals of Computation Theory, pages 565-574. Akademie-Verlag, 1979.
11. L. Lovász and M. Plummer. Matching Theory. Akadémiai Kiadó, 1986.
12. 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.
13. M. Mucha and P. Sankowski. Maximum matchings in planar graphs via gaussian elimination. 12th Annual European Symposium on Algorithms (ESA 2004), accepted.
14. M. O. Rabin and V. V. Vazirani. Maximum matchings in general graphs through randomization. Journal of Algorithms, 10:557-567, 1989.
15. A. Schrijver. Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag, 2003.
16. J. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27:701-717, 1980.
17. W. T. Tutte. The factorization of linear graphs. J. London Math. Soc., 22:107-111, 1947.
18. 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.