Graph Connectivities, Network Coding, and Expander Graphs

SIAM Journal on Computing, Volume 42, Issue 3, 2013, Pages 733-751.

Cited by: 22|Bibtex|Views13|Links
EI
Keywords:
graph connectivitiesnetwork codinglinear equationsingle source edge connectivitiesinteresting useMore(13+)

Abstract:

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 ...More

Code:

Data:

Your rating :
0

 

Tags
Comments