The Compactness of Interval Routing for Almost All Graphs

Cyril Gavoille, David Peleg. The Compactness of Interval Routing for Almost All Graphs. In Shay Kutten, editor, Distributed Computing, 12th International Symposium, DISC 98, Andros, Greece, September 24-26, 1998, Proceedings. Volume 1499 of Lecture Notes in Computer Science, pages 161-174, Springer, 1998. [doi]

Abstract

Abstract is missing.