Fast matrix rank algorithms and applications

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 549-561

  Cheung, Ho Yee ^a,b   Kwok, Tsz Chiu ^a   Lau, Lap Chi ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

combinatorial optimization; matrix rank; numerical linear algebra; randomized algorithm

Indexed keywords

BEST-KNOWN ALGORITHMS; DYNAMIC DATA STRUCTURE; FIELD OPERATION; GAUSSIAN ELIMINATION; MATRIX MULTIPLICATION; MATRIX RANK; NONZERO ENTRIES; NUMERICAL LINEAR ALGEBRA; RANDOMIZED ALGORITHMS; RUNNING TIME;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; DATA STRUCTURES;

MATRIX ALGEBRA;

EID: 84862592261     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214028     Document Type: Conference Paper

References (44)

1. R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung. Network Information Flow. IEEE Transactions on Information Theory, 46(4):1204-1216, 2000.
2. N. Ailon, B. Chazelle. Approximate Nearest Neighbors and the Fast Johnson-Lindenstrauss Transform. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 557-563, 2006.
3. N. Ailon, E. Liberty. An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. Proceddings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 185-191, 2011.
4. N. Alon, R. Yuster. Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. Proceedings of the 15th Annual European Symposium on Algorithms (ESA), 175-186, 2007.
5. A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi. An Õ(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 605-614, 2007.
6. J.R. Bunch, J.E. Hopcroft. Triangular Factorization and Inversion by Fast Matrix Multiplication. Mathematics of Computation, 28(125):231-236, 1974.
7. P. Bürgisser, M. Clausen, M.A. Shokrollahi. Algebraic Complexity Theory, Springer, 1997.
8. D. Charles, M. Chickering, N.R. Devanur, K. Jain, M. Sanghi. Fast Algorithms for Finding Matchings in Lopsided Bipartite Graphs with Applications to Display Ads. Proceedings of the ACM Conference on Electronic Commerce, 121-128, 2010.
9. L. Chen, W. Eberly, E. Kaltofen, B.D. Saunders, W.J. Turner, G. Villard. Efficient Matrix Preconditioners for Black Box Linear Algebra. Linear Algebra and its Applications, 343-344:119-146, 2002.
10. J. Cheriyan. Randomized Õ(M(|V|)) Algorithms for Problems in Matching Theory. SIAM Journal on Computing, 26(6):1635-1655, 1997. (Pubitemid 127582000)
11. H.Y. Cheung, L.C. Lau, K.M. Leung. Algebraic Algorithms for Linear Matroid Parity Problems. Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 1366-1382, 2011.
12. H.Y. Cheung, L.C. Lau, K.M. Leung. Graph Connectivities, Network Coding, and Expander Graphs. Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2011.
13. D. Coppersmith. Rectangular Matrix Multiplication Revisited. Journal of Complexity 13, 42-49, 1997. (Pubitemid 127172722)
14. D. Coppersmith, S. Winograd. Matrix Multiplication via Arithmetic Progressions. Journal of Symbolic Computation, 9:251-280, 1990.
15. W.H. Cunningham. Improved Bounds for Matroid Partition and Intersection Algorithms. SIAM Journal on Computing, 15(4):948-957, 1986.
16. G.S. Frandsen, P.F. Frandsen. Dynamic Matrix Rank. Proceedings of the 33rd International Colloquium on Automata, Language and Programming (ICALP), 395-406, 2006.
17. O. Gabber, Z. Galil. Explicit Constructions of Linear-Sized Superconcentrators. Journal of Computer and System Sciences, 22:407-420, 1981.
18. H.N. Gabow, M. Stallmann. An Augmenting Path Algorithm for Linear Matroid Parity. Combinatorica, 6:123-150, 1986.
19. H.N. Gabow, Y. Xu. Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems. Journal of Computer and System Sciences, 53:129-147, 1996. (Pubitemid 126358880)
20. J. von zur Gathen, J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2nd edition, 2003.
21. A.V. Goldberg, A.V. Karzanov. Maximum Skew-symmetric Flows and Matchings. Mathematical Programming, 100(3):537-568, 2004. (Pubitemid 40871698)
22. N. Harvey. Algebraic Algorithms for Matching and Matroid Problems. SIAM Journal on Computing, 39:679-702, 2009.
23. T. Ho, M. Médard, R. Koetter, D.R. Karger, M. Eros, J. Shi, B. Leong. A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory 52, 4413-4430, 2006. (Pubitemid 46445282)
24. J. Holm, K. de Lichtenberg, M. Thorup. Poly-logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum spanning tree, 2-edge, and Biconnectivity. Journal of the ACM, 48(4), 2001.
25. S. Hoory, N. Linial, A. Wigderson. Expander Graphs and their Applications. Bulletin (New series) of the American Mathematical Society, 43:439-561, 2006.
26. X. Huang, V. Pan. Fast Rectangular Matrix Multiplication and Applications. Journal of Complexity, 14(2): 257-299, 1998. (Pubitemid 128347318)
27. O.H. Ibarra, S. Moran, R. Hui. A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. Journal of Algorithms, 3(1):45-56, 1982.
28. A.W. Ingleton, M.J. Piff. Gammoids and Transversal Matroids. J. Combin. Theory Ser. B, 15, 51-68, 1973.
29. E. Kaltofen, B.D. Saunders. On Wiedemann's Method of Solving Sparse Linear Systems. In Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-9), 29-38, 1991.
30. L. Lovász. On Determinants, Matchings and Random Algorithms. In L. Budach, editor, Fundamentals of Computation Theory, FCT 79, 565-574. Akademie-Verlag, Berlin, 1979.
31. L. Lovász. Matroid Matching and Some Applications. Journal of Combinatorial Theory Series B, 28:208-236, 1980.
32. S. Micali, V.V. Vazirani. An O(√|V||E|) Algorithm for Finding Maximum Matching in General Graphs. In Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 17-27, 1980.
33. M. Mucha, P. Sankowski. Maximum matchings via Gaussian elimination. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 248-255, 2004.
34. P. Sankowski. Dynamic Transitive Closure via Dynamic Matrix Inverse. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 509-517, 2004.
35. P. Sankowski. Faster Dynamic Matchings and Vertex Connectivity. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 118-126, 2007.
36. T. Sarlós. Improved Approximation Algorithms for Large Matrices via Random Projections. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 143-152, 2006.
37. D. Saunders, A. Storjohann, G. Villard. Matrix Rank Certification. Electronic Journal of Linear Algebra, 11:16-23, 2004. (Pubitemid 38825897)
38. A. Schrijver. Combinatorial Optimization. Springer, 2003.
39. A. Storjohann. Integer Matrix Rank Certification. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), 2009.
40. L.N. Trefethen, D. Bau III. Numerical Linear Algebra, SIAM, 1997.
41. W.T. Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 22:107-111, 1947.
42. V.V. Vazirani. A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(√|V||E|) General Graph Matching Algorithm. In Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference (IPCO), 509-530, 1990.
43. D.H. Wiedemann. Solving Sparse Linear Equations Over Finite Fields. IEEE Transactions on Information Theory 32(1), 54-62, 1986.
44. M.A. Woodbury. Inverting Modified Matrices. Memorandum Report 42, Statistical Research Group, Princeton University, 1950.