Interval routing schemes

DOI10.1007/3-540-59042-0_80zbMath1379.68131OpenAlexW1837271383MaRDI QIDQ4596629

S. Salomone, Michele Flammini, Giorgio Gambosi

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

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

Related Items (5)

Multi-dimensional Interval Routing Schemes ⋮ Interval routing schemes ⋮ On Physical Mapping and the consecutive ones property for sparse matrices ⋮ A survey on interval routing ⋮ The complexity of the characterization of networks supporting shortest-path interval routing.

This page was built for publication: Interval routing schemes