A 2n-2 step algorithm for routing in an nxn array with constant size queues.
| Autor: | Leighton, T., Makedon, F., Tollis, I. G. |
|---|---|
| Zdroj: | Proceedings of the First Annual ACM Symposium: Parallel Algorithms & Architectures; Jun1989, p328-335, 8p |
| Databáze: | Complementary Index |
| Externí odkaz: |
|