This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Graph Connectivities, Network Coding, and Expander Graphs
Palm Springs, California USA
October 22-October 25
ISBN: 978-0-7695-4571-4
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.
Citation:
Ho Yee Cheung, Lap Chi Lau, Kai Man Leung, "Graph Connectivities, Network Coding, and Expander Graphs," focs, pp.190-199, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Usage of this product signifies your acceptance of the Terms of Use.