Worst Case Bounds for Shortest Path Interval Routing
From MaRDI portal
Publication:4209271
DOI10.1006/jagm.1997.0915zbMath0919.68047OpenAlexW2038033022MaRDI QIDQ4209271
Cyril Gavoille, Eric Guévremont
Publication date: 31 August 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/28d21e39233a9da79857a29ee2dc0dd23c3819b7
Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07) Computer system organization (68M99)
Related Items (9)
Average stretch analysis of compact routing schemes ⋮ Interval Routing Schemes for Circular-Arc Graphs ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ Compact and localized distributed data structures ⋮ Interval routing in reliability networks ⋮ Low-congested interval routing schemes for hypercubelike networks ⋮ The compactness of adaptive routing tables ⋮ A survey on interval routing ⋮ The complexity of the characterization of networks supporting shortest-path interval routing.
This page was built for publication: Worst Case Bounds for Shortest Path Interval Routing
