A lower bound for network navigability

DOI10.1137/06067626XMaRDI QIDQ3084213zbMATH OpenOpenAlexFDO

Authors 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) Graph algorithms (graph-theoretic aspects) (05C85) Stochastic network models in operations research (90B15)

Recommendations

• A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
• Navigability is a robust property
• Universal augmentation schemes for network navigability
• Could any graph be turned into a small-world?
• Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation

Cited in

(9)

• Universal augmentation schemes for network navigability
• Distance-based index structures for fast similarity search
• Navigation in spatial networks: a survey
• Informational cost and networks navigability
• Navigability is a robust property
• Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
• A piecewise linear upper bound on the network recourse function
• A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)

This page was built for publication: A lower bound for network navigability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084213)