Graph Connectivities, Network Coding, and Expander Graphs
From MaRDI portal
Publication:2848198
DOI10.1137/110844970zbMath1272.05099OpenAlexW2162003279MaRDI QIDQ2848198
Ho Yee Cheung, Lap Chi Lau, Kai Man Leung
Publication date: 25 September 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110844970
Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Randomized algorithms (68W20)
Related Items (4)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tree-core and tree-coritivity of graphs
This page was built for publication: Graph Connectivities, Network Coding, and Expander Graphs