Edge-Disjoint Paths in Expander Graphs

DOI10.1137/S0097539700366103zbMath0980.68144WikidataQ57401533 ScholiaQ57401533MaRDI QIDQ2706135

Alan M. Frieze

Publication date: 19 March 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

randomized algorithmsedge-disjoint pathsexpander graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items

Communication Lower Bounds via Critical Block Sensitivity ⋮ Extension Complexity of Independent Set Polytopes ⋮ Disjoint paths in sparse graphs ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ Unnamed Item ⋮ Braess's paradox in expanders

This page was built for publication: Edge-Disjoint Paths in Expander Graphs