As a consequences, the number of edges can be drammatically reduced at the cost of introducing some new virtual node.
The paper then introduce an optimized matrix-vector multiplication which reoders the adjencency matrix of the tranformed Web graph. This multiplication is then used to speed-up PageRank, Hits and Salsa on the compressed graph.
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiM8IMjlv9m-MvANR5o6VZ2_uaI5sGdvfzszQOSM5CWdKkrG01odaizLk_9yLit2y9LWzv_5W75AJ7DNf5khhIXLGa-3fvZTpIhUtMvRlcUTfITqPy9TLtwxuzABX0KZSTB2fv5OtRQWPor/s400/clique.jpg)
This comment has been removed by a blog administrator.
ReplyDeletethanks..
ReplyDelete