2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (2011)
Palm Springs, California USA
Oct. 22, 2011 to Oct. 25, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2011.55
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.
L. C. Lau, K. M. Leung and H. Y. Cheung, "Graph Connectivities, Network Coding, and Expander Graphs," 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science(FOCS), Palm Springs, California USA, 2011, pp. 190-199.