ABSTRACT
No abstract available.
- P. Desikan, N. Pathak, J. Srivastava and V. Kumar "Incremental PageRank Computation on evolving graphs" AHPCRC Technical Report 2004-195.Google Scholar
- Incremental page rank computation on evolving graphs
Recommendations
Efficient Densest Subgraph Computation in Evolving Graphs
WWW '15: Proceedings of the 24th International Conference on World Wide WebDensest subgraph computation has emerged as an important primitive in a wide range of data analysis tasks such as community and event detection. Social media such as Facebook and Twitter are highly dynamic with new friendship links and tweets being ...
On order and rank of graphs
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the number of vertices ...
Comments