Routing regardless of network stability

DOI10.1007/978-3-642-33090-2_62MaRDI QIDQ6826641zbMATH OpenFDO

Authors B. Laekhanukit, Adrian Vetta, Gordon Wilfong

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33090-2_62

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

This page was built for publication: Routing regardless of network stability

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