Low-congested interval routing schemes for hypercubelike networks
DOI10.1002/1097-0037(200010)36:3%3C191::AID-NET6%3E3.0.CO;2-KzbMATH Open1029.90015OpenAlexW2062019211MaRDI QIDQ4520243FDOQ4520243
Authors: Serafino Cicerone, Gabriele Di Stefano, Michele Flammini 
Publication date: 12 December 2000
Full work available at URL: https://doi.org/10.1002/1097-0037(200010)36:3%3C191::aid-net6%3E3.0.co;2-k
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Designing networks with compact routing tables
- Interval Routing
- On forwarding indices of networks
- Expanding and forwarding
- A survey on interval routing
- Labelling and Implicit Routing in Networks
- The forwarding index of communication networks
- Complexity of the Forwarding Index Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Worst Case Bounds for Shortest Path Interval Routing
- Title not available (Why is that?)
- The Complexity of Interval Routing on Random Graphs
- On Multi-Label Linear Interval Routing Schemes
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Low-congested interval routing schemes for hypercubelike networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520243)
