Edge-Disjoint Paths in Expander Graphs
From MaRDI portal
Publication:2706135
DOI10.1137/S0097539700366103zbMath0980.68144WikidataQ57401533 ScholiaQ57401533MaRDI QIDQ2706135
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
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