Existence and Construction of Edge-Disjoint Paths on Expander Graphs
From MaRDI portal
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Sums of independent random variables; random walks (60G50) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)
Recommendations
Cited in
(21)- Constructing disjoint paths on expander graphs
- Recursive construction for 3-regular expanders
- New algorithms for maximum disjoint paths based on tree-likeness
- Reliable communication over highly connected noisy networks
- On certain connectivity properties of the internet topology
- Edge-disjoint paths in expander graphs
- Routing in undirected graphs with constant congestion
- Sparsifying congested cliques and core-periphery networks
- Graphs, vectors, and matrices
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- scientific article; zbMATH DE number 1301961 (Why is no real title available?)
- Expanders via random spanning trees
- scientific article; zbMATH DE number 1380616 (Why is no real title available?)
- Arc-Disjoint Paths in Expander Digraphs
- Splitting an Expander Graph
- scientific article; zbMATH DE number 1445370 (Why is no real title available?)
- Almost polynomial hardness of node-disjoint paths in grids
- Using mixture models for collaborative filtering
- Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast
- Edge-disjoint paths in expanders: online with removals
- Highly symmetric expanders
This page was built for publication: Existence and Construction of Edge-Disjoint Paths on Expander Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312418)
