Interval routing schemes

DOI10.1007/PL00009211zbMath0896.68005OpenAlexW1990277587MaRDI QIDQ5906912

Cyril Gavoille, Pierre Fraigniaud

Publication date: 1 October 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009211

zbMATH Keywords

distributed memory parallel computerinterval routing

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (15)

Methods and problems of communication in usual networks ⋮ Bounding the locality of distributed routing algorithms ⋮ Interval routing in some planar networks. ⋮ Interval Routing Schemes for Circular-Arc Graphs ⋮ Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ Compact and localized distributed data structures ⋮ Distance labeling schemes for well-separated graph classes ⋮ Characterization of networks supporting multi-dimensional linear interval routing schemes ⋮ The compactness of adaptive routing tables ⋮ The complexity of shortest path and dilation bounded interval routing ⋮ A survey on interval routing ⋮ On the complexity of multi-dimensional interval routing schemes ⋮ Ordered interval routing schemes ⋮ Static and dynamic low-congested interval routing schemes

This page was built for publication: Interval routing schemes