FPPR: fast pessimistic (dynamic) PageRank to update PageRank in evolving directed graphs on network changes
RP Pashikanti, S Kundu - Social Network Analysis and Mining, 2022 - Springer
The paper presents a new algorithm FPPR which updates PageRanks of a directed network
after topological changes in the graphs. The algorithm is capable of regenerating scores on …
after topological changes in the graphs. The algorithm is capable of regenerating scores on …
Estimating Diffusion Degree on Graph Streams
VR Gore, S Kundu, AE Pratiwi - arXiv preprint arXiv:2401.17611, 2024 - arxiv.org
The challenges of graph stream algorithms are twofold. First, each edge needs to be
processed only once, and second, it needs to work on highly constrained memory. Diffusion …
processed only once, and second, it needs to work on highly constrained memory. Diffusion …
Estimating Diffusion Degree on Graph Stream Generated from Social and Web Networks
VR Gore, S Kundu, AE Pratiwi - International Conference on Web …, 2024 - Springer
Data stream generated from different Web 2.0 applications may contains data which is best
described by graphs. Graph streams thus generated show big data characters, including …
described by graphs. Graph streams thus generated show big data characters, including …
Check for updates Estimating Diffusion Degree on Graph Stream Generated from Social and Web Networks
VR Gore, S Kundu, AE Pratiwi - … , ICWE 2024, Tampere, Finland, June 17 … - books.google.com
Data stream generated from different Web 2.0 applications may contains data which is best
described by graphs. Graph streams thus generated show big data characters, including …
described by graphs. Graph streams thus generated show big data characters, including …
[PDF][PDF] FPPR: Fast Pessimistic (dynamic) PageRank to Update PageRank in Evolving Directed Graphs on Network Changes
PR Parjanya - 2022 - cse.iitj.ac.in
The paper presents a new algorithm FPPR which updates PageRanks of a directed network
after topological changes in the graphs. The algorithm is capable of regenerating scores on …
after topological changes in the graphs. The algorithm is capable of regenerating scores on …
FPPR: Fast Pessimistic (dynamic) PageRank to Update PageRank in Evolving Directed Graphs on Network Changes
S Kundu, RP Pashikanti - 2022 - researchsquare.com
The paper presents a new algorithm FPPR which updates PageRanks of a directed network
after topological changes in the graphs. The algorithm is capable of regenerating scores on …
after topological changes in the graphs. The algorithm is capable of regenerating scores on …