Pomelo: accurate and decentralized shortest-path distance estimation in social graphs

Zhuo Chen, Yang Chen, Cong Ding, Beixing Deng, Xing Li. Pomelo: accurate and decentralized shortest-path distance estimation in social graphs. In Srinivasan Keshav, Jörg Liebeherr, John W. Byers, Jeffrey C. Mogul, editors, Proceedings of the ACM SIGCOMM 2011 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Toronto, ON, Canada, August 15-19, 2011. pages 406-407, ACM, 2011. [doi]

@inproceedings{ChenCDDL11,
  title = {Pomelo: accurate and decentralized shortest-path distance estimation in social graphs},
  author = {Zhuo Chen and Yang Chen and Cong Ding and Beixing Deng and Xing Li},
  year = {2011},
  doi = {10.1145/2018436.2018491},
  url = {http://doi.acm.org/10.1145/2018436.2018491},
  tags = {graph-rewriting, social, rewriting},
  researchr = {https://researchr.org/publication/ChenCDDL11},
  cites = {0},
  citedby = {0},
  pages = {406-407},
  booktitle = {Proceedings of the ACM SIGCOMM 2011 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Toronto, ON, Canada, August 15-19, 2011},
  editor = {Srinivasan Keshav and Jörg Liebeherr and John W. Byers and Jeffrey C. Mogul},
  publisher = {ACM},
  isbn = {978-1-4503-0797-0},
}