We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...