Brief announcement: tight lower bounds for greedy routing in uniform small world rings.
Martin DietzfelbingerPhilipp WoelfelPublished in: PODC (2009)
Keyphrases
- lower bound
- small world
- upper bound
- small world networks
- scale free
- complex networks
- path length
- social networks
- power law
- network topology
- worst case
- clustering coefficient
- np hard
- objective function
- small world properties
- random graphs
- network structure
- routing protocol
- shortest path
- optimal solution
- social relationships
- social network analysis
- search algorithm
- ad hoc networks
- biological networks
- numerical simulations
- search space
- degree distribution
- power law degree distribution