Graph Connectivities, Network Coding, and Expander Graphs
From MaRDI portal
Publication:5494964
DOI10.1109/FOCS.2011.55zbMath1292.68121MaRDI QIDQ5494964
Lap Chi Lau, Ho Yee Cheung, Kai Man Leung
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (6)
On Element-Connectivity Preserving Graph Simplification ⋮ Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs ⋮ Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) ⋮ Hardness of graph-structured algebraic and symbolic problems ⋮ On Approximating Matrix Norms in Data Streams ⋮ Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors
This page was built for publication: Graph Connectivities, Network Coding, and Expander Graphs
