On the searchability of small-world networks with arbitrary underlying structure

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]

Abstract

Abstract is missing.