Graph connectivities, network coding, and expander graphs
From MaRDI portal
Recommendations
- Expander graphs and their applications
- Graph theoretic methods in coding theory
- On the sizes of expander graphs and minimum distances of graph codes
- On expander graphs and connectivity in small space
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Codes from Expander Graphs
- Representations of graphs and networks (coding, packings and embeddings)
- scientific article; zbMATH DE number 5010757
- Connectivity and extendability in digraphs
- The complexity of graph connectivity
Cited in
(10)- Tree-core and tree-coritivity of graphs
- Using expander graphs to find vertex connectivity
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Faster algorithms for all-pairs bounded min-cuts
- New algorithms and lower bounds for all-pairs max-flow in undirected graphs
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- scientific article; zbMATH DE number 7759458 (Why is no real title available?)
- An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
- Space complexity of vertex connectivity oracles
- An enumerative perspective on connectivity
This page was built for publication: Graph connectivities, network coding, and expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848198)
