Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Packet routing in fixed-connection networks;Grammatikakis;J. Parallel Distributed Comput.,1998
2. New bounds for oblivious mesh routing;Iwama;J. Graph Algorithms Appl.,2001
3. K. Iwama, E. Miyano, A (2.954+e)n oblivious routing algorithm on 2d meshes, in: Proc. 12th Ann. ACM Symp. on Parallel Algorithms and Architectures 2000, pp. 186–195.
4. An O(N) oblivious routing algorithm for 2-D meshes of constant queue-size;Iwama;J. of Algorithms,2001
5. C. Kaklamanis, D. Krizanc, T. Tsantilas, Tight bounds for oblivious routing in the hypercube, in: Proc. 2nd Ann. ACM Symp. on Parallel Algorithms and Architectures, 1990, pp. 31–36.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Permutation Routing and (ℓ, k)-Routing on Plane Grids;Texts in Theoretical Computer Science. An EATCS Series;2009