The Complexity of Interval Routing on Random Graphs.

Michele Flammini Jan van Leeuwen Alberto Marchetti-Spaccamela

Published in: Comput. J. (1998)

Keyphrases

random graphs
network topologies
learning curves
graph theoretic
worst case
shortest path
upper bound
undirected graph
small world