Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing

Authors:
Kazuo Iwama;Eiji Miyano
Affiliations:
-;-
Venue:
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Year:
1997

Citing 0
Cited 3

An O( N ) oblivious routing algorithm for 2-D meshes of constant queue-size

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
New Bounds for Oblivious Mesh Routing

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract