Skip to content

Instantly share code, notes, and snippets.

@wolfram77

wolfram77/notes-sticd-algorithmic-techniques-for-efficient-parallel-pagerank-computation-on-real-world-graphs.md

Last active September 26, 2021 03:02
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save wolfram77/bb09968cc0e592583c4b180243697d5a to your computer and use it in GitHub Desktop.
Save wolfram77/bb09968cc0e592583c4b180243697d5a to your computer and use it in GitHub Desktop.
Download ZIP
STIC-D: Algorithmic Techniques For Efficient Parallel Pagerank Computation on Real-World Graphs : NOTES
Raw
notes-sticd-algorithmic-techniques-for-efficient-parallel-pagerank-computation-on-real-world-graphs.md

Highlighted notes on:
STIC-D: Algorithmic Techniques For Efficient Parallel Pagerank Computation on Real-World Graphs.

Authors:

  • Paritosh Garg
  • Kishore Kothapalli

Publication:
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and Networking. January 2016.
Article No.: 15 Pages 1–10
https://doi.org/10.1145/2833312.2833322

Display the source blob
Display the rendered blob
Raw
notes-sticd-algorithmic-techniques-for-efficient-parallel-pagerank-computation-on-real-world-graphs.pdf
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment