![Graph coloring / Vertex / Graph / Bellman–Ford algorithm / Connected component / Shortest path problem / Tree / Clique / Matching / Graph theory / Graph connectivity / Path Graph coloring / Vertex / Graph / Bellman–Ford algorithm / Connected component / Shortest path problem / Tree / Clique / Matching / Graph theory / Graph connectivity / Path](https://www.pdfsearch.io/img/0e8ba729bb1120980d56447381660f74.jpg) Date: 2011-10-18 16:44:37Graph coloring Vertex Graph Bellman–Ford algorithm Connected component Shortest path problem Tree Clique Matching Graph theory Graph connectivity Path | | Pregel: A System for Large-Scale Graph Processing Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski Google, Inc. {malewicz,austern,ajcbik,dehnert,ilAdd to Reading ListSource URL: kowshik.github.ioDownload Document from Source Website File Size: 473,87 KBShare Document on Facebook
|