Edge-disjoint routing in plane switch graphs in linear time.

DOI10.1145/1008731.1008737MaRDI QIDQ3069904zbMATH OpenOpenAlexFDO

Authors Jan M. Hochstein, Karsten Weihe

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• An Algorithmic Study of Switch Graphs
• An algorithmic study of switch graphs
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Routing through a generalized switchbox
• Edge-disjoint paths in planar graphs

Cited in

(6)

• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• The weighted link ring loading problem
• The Simple Reachability Problem in Switch Graphs
• SWITCHING GRAPHS
• An algorithmic study of switch graphs
• Switching graphs

This page was built for publication: Edge-disjoint routing in plane switch graphs in linear time.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069904)