The Complexity of Interval Routing on Random Graphs

Authors:
Michele Flammini;Jan van Leeuwen;Alberto Marchetti-Spaccamela
Affiliations:
-;-;-
Venue:
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Year:
1995

Optimal routing tables

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Static and dynamic low-congested interval routing schemes

Theoretical Computer Science
Routing in distributed networks: overview and open problems

ACM SIGACT News
Efficient Communication Schemes

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks

Journal of Parallel and Distributed Computing

Hi-index	0.00