☆
Scalable Data-driven PageRank: Algorithms, System Issues, and Lessons Learned

Comments:

Nice paper! Algorithm 4, line 14: remove $new$ from $x^{new}_v=x_v+r_v$. I don't understand the parallelization/scheduling part. May come back to that latter. I have an implementation of the push method here: https://github.com/maxdan94/push I will compare the speed.
Maximimi at 2021-01-26 16:39:42
Read the paper, add your comments…
☆
Compact structure for sparse undirected graphs based on aclique graph partition

Comments:

Read the paper, add your comments…
☆
efficient maximum clique computation and enumeration over large sparse graphs

Comments:

full version here : https://link.springer.com/article/10.1007%2Fs00778-020-00602-z including results with parallelization
IoannisPan at 2021-01-05 16:56:44
Read the paper, add your comments…
☆
Hardness of Easy Problems: Basing Hardness onPopular Conjectures such as the StrongExponential Time Hypothesis

Comments:

Read the paper, add your comments…
☆
HyperANF: Approximating the Neighbourhood Function ofVery Large Graphs on a Budget

Comments:

Read the paper, add your comments…
Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38