Date: 2013-01-24 11:44:53

Graph 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,il

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 473,87 KB