1 search results - page 1 / 1 » Approximating the minimum rank of a graph via alternating pr... |
WWW
2004
ACM
14 years 5 months ago
2004
ACM
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 ...