Characterization results of all shortest paths interval routing schemes (1998)
M. Flammini, G. Gambosi, U. Nanni, R. B. Tan
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 \Gamma SLIRS (Strict Linear Interval Routing Schemes) and 1 \Gamma LIRS...
The Complexity of Interval Routing on Random Graphs (1998)
Flammini, M., Van Leeuwen, J., Marchetti-Spaccamela, A.
Several methods exist for routing messages in a network without using complete routing tables (compact routing). In k-interval routing schemes (k-IRS), links carry up to k intervals each. A message...
The complexity of interval routing on random graphs (1995)
M. Flammini, J. Van Leeuwen, A. Marchetti-spaccamela, Michele Flammini, Jan Van Leeuwen, Alberto Marchetti-spaccamela
Abstract. Several methods exist for routing messages in a network without using complete routing tables (compact routing). In k-interval routing schemes (k-IR.S), links carry up to k intervals each....