New Bounds for Oblivious Mesh Routing

DOI10.7155/jgaa.00038zbMath0985.68005OpenAlexW2061583774MaRDI QIDQ2755057

Yahiko Kambayashi, Eiji Miyano, Kazuo Iwama

Publication date: 7 January 2002

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/49185

zbMATH Keywords

oblivious permutation routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

On Inconsistent Clause-Subsets for Max-SAT Solving ⋮ Optimal oblivious routing on \(d\)-dimensional meshes ⋮ Efficient randomized routing algorithms on the two-dimensional mesh of buses

This page was built for publication: New Bounds for Oblivious Mesh Routing