Characterization results of all shortest paths interval routing schemes

DOI10.1002/net.1017zbMath1013.68144OpenAlexW2117860759MaRDI QIDQ2744657

Richard B. Tan, Giorgio Gambosi, Michele Flammini, Umberto Nanni

Publication date: 26 June 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.1017

zbMATH Keywords

shortest pathsinterval routingdynamic cost

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (6)

All-shortest-path 2-interval routing is NP-complete ⋮ On devising Boolean Routing Schemes ⋮ On the hardness of minimizing space for all-shortest-path interval routing schemes ⋮ The compactness of adaptive routing tables ⋮ A survey on interval routing ⋮ Ordered interval routing schemes

Cites Work

• Designing networks with compact routing tables
• Multidimensional interval routing schemes
• On interval routing schemes and treewidth
• On devising Boolean Routing Schemes
• A survey on interval routing
• Labelling and Implicit Routing in Networks
• Interval Routing
• Partial characterizations of networks supporting shortest path interval labeling schemes
• Interval routing schemes

This page was built for publication: Characterization results of all shortest paths interval routing schemes