Greedy routing and diameter bounds for small-world graphs are generalized from lattices to fixed-growth graphs of any dimensionality alpha, with an empirical application to U.S. road networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Fast Geographic Routing in Fixed-Growth Graphs
Greedy routing and diameter bounds for small-world graphs are generalized from lattices to fixed-growth graphs of any dimensionality alpha, with an empirical application to U.S. road networks.