Interval routing schemes

DOI10.1007/3-540-59042-0_80MaRDI QIDQ4596629zbMATH OpenOpenAlexFDO

Authors Michele Flammini, Giorgio Gambosi, S. Salomone

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_80

zbMATH Keywords

computational complexitytheory of parallel and distributed computing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network design and communication in computer systems (68M10)

Recommendations

• Interval routing schemes
• Interval Routing
• Interval routing schemes
• The complexity of the characterization of networks supporting shortest-path interval routing.
• A survey on interval routing

Cited in

(15)

• The complexity of interval routing on random graphs
• Ordered interval routing schemes
• The Complexity of Interval Routing on Random Graphs
• Multi-dimensional Interval Routing Schemes
• The complexity of the characterization of networks supporting shortest-path interval routing.
• Partial characterizations of networks supporting shortest path interval labeling schemes
• Topological routing schemes
• Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
• Interval routing schemes allow broadcasting with linear message-complexity
• On Physical Mapping and the consecutive ones property for sparse matrices
• Interval routing schemes
• A survey on interval routing
• FIR: an efficient routing strategy for tori and meshes
• Interval routing schemes for circular-arc graphs
• Interval Routing

This page was built for publication: Interval routing schemes

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