Assume we have computed the Pagerank of the vertices of a given graph. Then, remove a vertex from this graph, with all its edges.

How to efficiently compute the Pagerank of remaining vertices in the new graph?

Would it help to know that we remove the vertex with highest Pagerank?

I see work on edge removals in the literature, but updating after vertex removal may be faster than updating after removal of each of its edges, in particular in the the highest-Pagerank removal case.



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.