Connected Components at Scale via Local Contractions — mentioned by moab

Mon, 10 Jun 2019 02:41:27 GMT

Here are a few references that solve problems on very large graphs: [1] implements work-efficient parallel algorithms for a list of fundamental graph problems. They report times on a O(200B) edge graph on a single multicore. [2] reports distributed running times for BFS, connectivity, PageRank, and SSSP on a large number of distributed hosts. The times are usually slower than the single-machine times, despite using two orders of magnitude more threads. [3] Reports connectivity times on a truly large graph that is not publicly available (several trillions of edges). My feeling is that unless…

Paper and discussion history. A mention is not an endorsement.

Connected Components at Scale via Local Contractions · HackerPapers discussions

Connected Components at Scale via Local Contractions — mentioned by moab