Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
A ‘contact network’ modeling infection transmission comprises of nodes (or individuals) that are linked when they are in contact that possibly transmits an infection. We here s...
As part of the delivery an automated hub for a postal operator, the Solystic company has to build a complex and feature rich Information System that supports a highly automated pr...
The World Wide Web grows through a decentralized, almost anarchic process, and this has resulted in a large hyperlinked corpus without the kind of logical organization that can be...
David Gibson, Jon M. Kleinberg, Prabhakar Raghavan