A compact routing scheme and approximate distance oracle for power-law graphs

@article{Chen2012ACR,
  title={A compact routing scheme and approximate distance oracle for power-law graphs},
  author={Wei Chen and Christian Sommer and Shang-Hua Teng and Yajun Wang},
  journal={ACM Trans. Algorithms},
  year={2012},
  volume={9},
  pages={4:1-4:26}
}
Compact routing addresses the tradeoff between table sizes and stretch, which is the worst-case ratio between the length of the path a packet is routed through by the scheme and the length of an actual shortest path from source to destination. We adapt the compact routing scheme by Thorup and Zwick [2001] to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted random power-law graphs with fixed expected degree sequence by Aiello et al. [2000… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS