Tight lower bounds for greedy routing in uniform small world rings.
Martin DietzfelbingerPhilipp WoelfelPublished in: STOC (2009)
Keyphrases
- lower bound
- small world
- upper bound
- small world networks
- scale free
- power law
- network structure
- network topology
- complex networks
- social networks
- worst case
- optimal solution
- path length
- np hard
- small world properties
- objective function
- clustering coefficient
- feature selection
- social network analysis
- search algorithm
- social relationships
- shortest path
- search space
- random graphs
- preferential attachment