For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....