# On the Distributed Complexity of Large-Scale Graph Computations

SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures Vienna Austria July, 2018, pp. 405-414, 2018.

Cited by: 18|Views33
EI

Abstract:

Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$ machines jointly perform computations on graphs with n nodes (typically, $n \gg k$). The input graph is ass...More

Code:

Data:

Get fulltext within 24h
Bibtex