Partial characterizations of networks supporting shortest path interval labeling schemes
From MaRDI portal
Publication:4540069
DOI<103::AID-NET3>3.0.CO;2-F 10.1002/(SICI)1097-0037(199809)32:2<103::AID-NET3>3.0.CO;2-FzbMath1015.68008OpenAlexW2016757044MaRDI QIDQ4540069
Sunil M. Shende, Lata Narayanan
Publication date: 21 July 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199809)32:2<103::aid-net3>3.0.co;2-f
Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Related Items (7)
Interval routing in some planar networks. ⋮ Compact and localized distributed data structures ⋮ Characterization results of all shortest paths interval routing schemes ⋮ Characterization of networks supporting multi-dimensional linear interval routing schemes ⋮ A survey on interval routing ⋮ Ordered interval routing schemes ⋮ The complexity of the characterization of networks supporting shortest-path interval routing.
This page was built for publication: Partial characterizations of networks supporting shortest path interval labeling schemes
