An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size

DOI10.1006/JAGM.2001.1176zbMath1017.68151OpenAlexW2018133874MaRDI QIDQ2775890

Kazuo Iwama, Eiji Miyano

Publication date: 8 July 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2001.1176

zbMATH Keywords

oblivious permutation-routing algorithm for two-dimensional meshes

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

Optimal oblivious routing on \(d\)-dimensional meshes

This page was built for publication: An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size