Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graph Connectivities, Network Coding, and Expander Graphs

From MaRDI portal
Publication:2848198
Jump to:navigation, search

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


zbMATH Keywords

linear equationsrandomized algorithmsnetwork codingexpander graphsgraph connectivities


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2848198&oldid=15782063"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki