The complexity of interval routing on random graphs
From MaRDI portal
Publication:3568998
DOI10.1007/3-540-60246-1_111zbMath1193.68189OpenAlexW2146257986MaRDI QIDQ3568998
Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/17356
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Deadlock-free interval routing schemes, Multi-dimensional Interval Routing Schemes, Interval routing schemes allow broadcasting with linear message-complexity, Multidimensional interval routing schemes, The complexity of shortest path and dilation bounded interval routing, A survey on interval routing, Static and dynamic low-congested interval routing schemes
