Edge-disjoint routing in plane switch graphs in linear time
From MaRDI portal
Publication:3069904
DOI10.1145/1008731.1008737zbMath1204.68106OpenAlexW2085591112MaRDI QIDQ3069904
Karsten Weihe, Jan M. Hochstein
Publication date: 1 February 2011
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1008731.1008737
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
The weighted link ring loading problem ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Switching Graphs ⋮ SWITCHING GRAPHS
This page was built for publication: Edge-disjoint routing in plane switch graphs in linear time
