Pierre Fraigniaud, George Giakkoupis. On the searchability of small-world networks with arbitrary underlying structure. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 389-398, ACM, 2010. [doi]
@inproceedings{FraigniaudG10-0,
title = {On the searchability of small-world networks with arbitrary underlying structure},
author = {Pierre Fraigniaud and George Giakkoupis},
year = {2010},
doi = {10.1145/1806689.1806744},
url = {http://doi.acm.org/10.1145/1806689.1806744},
tags = {search},
researchr = {https://researchr.org/publication/FraigniaudG10-0},
cites = {0},
citedby = {0},
pages = {389-398},
booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
editor = {Leonard J. Schulman},
publisher = {ACM},
isbn = {978-1-4503-0050-6},
}