Existence and Construction of Edge-Disjoint Paths on Expander Graphs
From MaRDI portal
Publication:4312418
DOI10.1137/S0097539792232021zbMath0808.05087WikidataQ57401575 ScholiaQ57401575MaRDI QIDQ4312418
Andrei Z. Broder, Eli Upfal, Alan M. Frieze
Publication date: 9 March 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Sums of independent random variables; random walks (60G50) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Graphs, Vectors, and Matrices, Unnamed Item, Highly symmetric expanders, Reliable communication over highly connected noisy networks, On certain connectivity properties of the internet topology, New algorithms for maximum disjoint paths based on tree-likeness, Routing in Undirected Graphs with Constant Congestion, Using mixture models for collaborative filtering, Sparsifying Congested Cliques and Core-Periphery Networks, Optimal Construction of Edge-Disjoint Paths in Random Graphs, Unnamed Item
