A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes
From MaRDI portal
Publication:2729648
DOI10.1006/JAGM.2000.1152zbMath0974.68237OpenAlexW2073184991MaRDI QIDQ2729648
Publication date: 12 December 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1152
Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)
This page was built for publication: A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes