Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover

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

Volumn 4698 LNCS, Issue , 2007, Pages 175-186

  Alon, Noga ^a   Yustcr, Raphael ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; PROBLEM SOLVING; SET THEORY;

BOOLEAN PRODUCT; RECTANGULAR MATRIX; SUBSET MATCHING; UNWEIGHTED GRAPHS;

GRAPH THEORY;

EID: 38049057332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_17     Document Type: Conference Paper

References (23)

1. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 434-449 (1996)
2. Blum, N.: A New Approach to Maximum Matching in General Graphs. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol. 443, pp. 586-597. Springer, Heidelberg (1990)
3. Bunch, J., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation 28, 231-236 (1974)
4. Coppersmith, D.: Rectangular matrix multiplication revisited. Journal of Complexity 13, 42-49 (1997)
5. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9, 251-280 (1990)
6. Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449-467 (1965)
7. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. Journal of the ACM 38(4), 815-853 (1991)
8. Galil, Z., Margalit, O.: All Pairs Shortest Paths for graphs with small integer length edges. Journal of Computer and System Sciences 54, 243-254 (1997)
9. th IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, CA (October 2006)
10. Huang, X., Pan, V.Y.: Fast rectangular matrix multiplications and applications. Journal of Complexity 14, 257-299 (1998)
11. nd ACM Symposium on Computational Geometry (SOCG), pp. 52-60 (2006)
12. Lovász, L.: On determinants, matchings, and random algorithms. In: Fundamentals of computation theory, vol. 2, pp. 565-574. Akademie, Berlin (1979)
13. st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 17-27, 1980.
14. th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 248 255. IEEE Computer Society Press, Los Alamitos (2004)
15. Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM 27(4), 701-717 (1980)
16. Seidel, R.: On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. Journal of Computer and System Sciences 51(3), 400-403 (1995)
17. th Symposium of Foundations of Computer Science (FOCS), pp. 605-614 (1999)
18. Tutte, W.T.: The factorization of linear graphs. Journal of the London Mathematical Society 22, 107-111 (1947)
19. Vazirani, V.V.: A theory of alternating paths and blossoms for proving correctness of the O(√E) general graph maximum matching algorithm. Combinatorica 14(1), 71-109 (1994)
20. Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods 2(1), 77-79 (1981)
21. Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Transactions on Algorithms 1, 2-13 (2005)
22. 2.81 infinite-precision multiplications. Information Processing Letters 4, 155-156 (1976)
23. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216-226. Springer, Heidelberg (1979)