Compact routing with stretch factor of less than three (brief announcement)

Authors:
Kazuo Iwama;Akinori Kawachi
Affiliations:
School of Informatics, Kyoto University, Kyoto 606-8501, Japan;School of Informatics, Kyoto University, Kyoto 606-8501, Japan
Venue:
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Year:
2000

Compact routing with minimum stretch

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Compact routing for average-case networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Compact Routing in Directed Networks with Stretch Factor of Two

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Compact roundtrip routing with topology-independent node names

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Compact roundtrip routing with topology-independent node names

Journal of Computer and System Sciences
Dynamic routing schemes for graphs with low local density

ACM Transactions on Algorithms (TALG)
Sparse spanners vs. compact routing

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Dynamic routing schemes for general graphs

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Hi-index	0.00