Partial characterizations of networks su
โ
Narayanan, Lata; Shende, Sunil
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 159 KB
In this paper, we consider the problem of shortest path interval routing, a space-efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The re