Compact routing for average-case networks

Authors:
Kazuo Iwama;Masaki Okita
Affiliations:
School of Informatics, Kyoto University, Kyoto;School of Informatics, Kyoto University, Kyoto
Venue:
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Year:
2002

Citing 2
Cited 3

Compact routing with minimum stretch

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact routing with stretch factor of less than three (brief announcement)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed 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)

Quantified Score

Hi-index	0.00

Visualization

Abstract