A Lower Bound for Network Navigability

DOI10.1137/06067626XzbMath1207.05186OpenAlexW1992732243MaRDI QIDQ3084213

Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker

Publication date: 15 March 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/06067626x

zbMATH Keywords

doubling dimensiongreedy routingsmall world

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Distance-based index structures for fast similarity search ⋮ Informational cost and networks navigability ⋮ Navigation in spatial networks: a survey

This page was built for publication: A Lower Bound for Network Navigability