The Compactness of Interval Routing
From MaRDI portal
Publication:4699171
DOI10.1137/S0895480197328631zbMath0929.68070MaRDI QIDQ4699171
Publication date: 23 November 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Linearity is strictly more powerful than contiguity for encoding graphs ⋮ Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs ⋮ Average stretch analysis of compact routing schemes ⋮ (Nearly-)tight bounds on the contiguity and linearity of cographs ⋮ Distributed computing of efficient routing schemes in generalized chordal graphs ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices ⋮ Interval routing in reliability networks ⋮ The compactness of adaptive routing tables ⋮ Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
This page was built for publication: The Compactness of Interval Routing
