Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids
Martin DietzfelbingerPhilipp WoelfelPublished in: CoRR (2013)
Keyphrases
- higher dimensional
- lower bound
- small world
- upper bound
- small world networks
- scale free
- power law
- network topology
- complex networks
- network structure
- path length
- social networks
- low dimensional
- high dimensional
- routing protocol
- np hard
- euclidean space
- objective function
- ad hoc networks
- shortest path
- worst case
- optimal solution
- clustering coefficient
- distance transform
- random graphs
- small world properties
- social relationships
- social network analysis
- multiscale
- wavelet transform
- computational complexity