Interval Routing

DOI10.1093/COMJNL/30.4.298MaRDI QIDQ3798237zbMATH OpenOpenAlexFDO

Authors J. Van Leeuwen, Richard B. Tan

Publication date 1987

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/30.4.298

zbMATH Keywords

message complexityinterval routingdistributive networkgeneration of spanning treesleader- finding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Recommendations

• Interval routing schemes
• Interval routing schemes
• Interval routing schemes
• Interval routing schemes allow broadcasting with linear message-complexity
• scientific article; zbMATH DE number 4085576

Cited in

(42)

• Low-congested interval routing schemes for hypercubelike networks
• Graphs with bounded induced distance
• Characterization results of all shortest paths interval routing schemes
• On compact and efficient routing in certain graph classes
• Algorithms and Computation
• On multi-label linear interval routing schemes
• Topological routing schemes
• Characterization of networks supporting multi-dimensional linear interval routing schemes
• Compact and localized distributed data structures
• New bounds for multi-label interval routing
• On devising Boolean Routing Schemes
• Multidimensional interval routing schemes
• An optimal message routing algorithm for double-loop networks
• Interval routing schemes for circular-arc graphs
• Interval routing schemes
• Max-stretch reduction for tree spanners
• Interval routing schemes
• Designing networks with compact routing tables
• Time-dependent routing
• Graph theoretical issues in computer networks
• scientific article; zbMATH DE number 4085576 (Why is no real title available?)
• All-shortest-path 2-interval routing is NP-complete
• Representing graphs implicitly using almost optimal space
• On the hardness of minimizing space for all-shortest-path interval routing schemes
• A note on models for graph representations
• A survey on interval routing
• Universal routing schemes
• A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing
• Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
• Multi-dimensional Interval Routing Schemes
• Ordered interval routing schemes
• Interval routing schemes allow broadcasting with linear message-complexity
• A fault-tolerant routing scheme in dynamic networks
• The complexity of shortest path and dilation bounded interval routing
• Interval routing in some planar networks.
• Deadlock-free interval routing schemes
• Interval routing in reliability networks
• The compactness of adaptive routing tables
• The complexity of the characterization of networks supporting shortest-path interval routing.
• On the complexity of multi-dimensional interval routing schemes
• Static and dynamic low-congested interval routing schemes
• On devising Boolean Routing schemes

This page was built for publication: Interval Routing

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