Partial characterizations of networks supporting shortest path interval labeling schemes

DOI10.1002/(SICI)1097-0037(199809)32:2%3C103::AID-NET3%3E3.0.CO;2-FMaRDI QIDQ4540069zbMATH OpenOpenAlexFDO

Authors Lata Narayanan, Sunil Shende

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199809)32:2%3C103::aid-net3%3E3.0.co;2-f

zbMATH Keywords

shortest path interval routing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Parallel algorithms in computer science (68W10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• The complexity of the characterization of networks supporting shortest-path interval routing.
• scientific article; zbMATH DE number 1038840
• Interval routing schemes for circular-arc graphs
• On Multi-Label Linear Interval Routing Schemes
• Interval routing schemes

Cited in

(9)

• Ordered interval routing schemes
• Characterization results of all shortest paths interval routing schemes
• Compact and localized distributed data structures
• The complexity of the characterization of networks supporting shortest-path interval routing.
• Interval routing in some planar networks.
• A survey on interval routing
• Interval routing schemes for circular-arc graphs
• Characterization of networks supporting multi-dimensional linear interval routing schemes
• On Interval Routing Schemes and treewidth

This page was built for publication: Partial characterizations of networks supporting shortest path interval labeling schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540069)