The Compactness of Interval RoutingCyril Gavoille

Abstract

The compactness of a graph measures the space complexity of its shortest path routing tables. Each outgoing edge of a node x is assigned a (pairwise disjoint) set of addresses, such that the unique outgoing edge containing the address of a node y is the rst edge of a shortest path from x to y. The complexity measure used in the context of interval routing… (More)

Topics

  • Presentations referencing similar topics