Fast Incremental Proximity Search in Large Graphs
Published on Aug 01, 20085445 Views
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techniques to compute appro