Maximum matchings in planar graphs via gaussian elimination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 532-543

  Mucha, Martin ^a   Sankowski, Piotr ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); GRAPH THEORY; GRAPHIC METHODS;

EXTENDED ABSTRACTS; GAUSSIAN ELIMINATION; MATCHING PROBLEMS; MATRIX MULTIPLICATION ALGORITHM; MAXIMUM MATCHINGS; PLANAR GRAPH; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 35048891976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_48     Document Type: Article

References (21)

1. Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. 45th Annual IEEE Symposium on Foundations of Computer Science, accepted (2004)
2. Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17 (1965) 449-467
3. Micali, S., Vazirani, V.V.: An 0(√|V∥e|) algorithm for finding maximum matching in general graphs. In: Proceedings of the twenty first annual IEEE Symposium on Foundations of Computer Science. (1980) 17-27
4. Blum, N.: A new approach to maximum matching in general graphs. In: Proc. 17th ICALP. Volume 443 of LNCS., Springer-Verlag (1990) 586-597
5. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. J. ACM 38 (1991) 815-853
6. Miller, G.L., Naor, J.: Flow in planar graphs with multiple sources and sinks. In: Proc. 30th IEEE Symp. Foundations of Computer Science. (1989) 112-117
7. Klein, P., Rao, S., Hauch, M., Subramanian, S.: Faster shortest-path algorithms for planar graphs. In: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, ACM Press (1994) 27-37
8. Lovász, L.: On determinants, matchings and random algorithms. In Budach, L., ed.: Fundamentals of Computation Theory, Akademie-Verlag (1979) 565-574
9. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, ACM Press (1987) 1-6
10. Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13 (1969) 354-356
11. Wilson, D.B.: Determinant algorithms for random planar structures. In: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics (1997) 258-267
12. Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. 22 (1947) 107-111
13. Rabin, M.O., Vazirani, V.V.: Maximum matchings in general graphs through randomization. Journal of Algorithms 10 (1989) 557-567
14. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: International Symposium on Symbolic and Algebraic Computation. Volume 72 of LNCS., Berlin, Springer-Verlag (1979) 216-226
15. Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27 (1980) 701-717
16. Bunch, J., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation 28 (1974) 231-236
17. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Applied Math. (1979) 177-189
18. Lipton, R.J., Rose, D.J., Tarjan, R.: Generalized nested dissection. SIAM J. Num. Anal. 16 (1979) 346-358
19. Pan, V.Y., Reif, J.H.: Fast and efficient parallel solution of sparse linear systems. SIAM J. Comput. 22 (1993) 1227-1250
20. Khaira, M.S., Miller, G.L., Sheffler, T.J.: Nested dissection: A survey. Technical Report CS-92-106 (1992)
21. Kowalewski, G.: Einfuhrung in die Determinanten Theorie. Leipzig Verlag von Veit & Co. (1909)