The complexity of interval routing on random graphs
From MaRDI portal
Publication:3568998
DOI10.1007/3-540-60246-1_111zbMath1193.68189MaRDI QIDQ3568998
Alberto Marchetti-Spaccamela, Michele Flammini, Jan van Leeuwen
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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Multidimensional interval routing schemes, The complexity of shortest path and dilation bounded interval routing, A survey on interval routing