Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast deterministic algorithms for matrix completion problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We present a new algebraic formulation to compute edge connectivities in a directed graph, using the ideas developed in network coding. This reduces the problem of computing edge connectivities to solving systems of linear equations, thus allowing us to use tools in linear algebra to design new algorithms. Using the algebraic formulation we obtain faster algorithms for computing single source edge connectivities and all pairs edge connectivities, in some settings the amortized time to compute the edge connectivity for one pair is sub linear. Through this connection, we have also found an interesting use of expanders and super concentrators to design fast algorithms for some graph connectivity problems.