Login / Signup
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space.
Krzysztof Onak
Published in:
CoRR (2018)
Keyphrases
</>
computational complexity
computational cost
graph theory
depth first search
optimization problems
random walk
parallel processing
edge weights
data structure
connected components
space complexity
parallel implementation
maximum flow
partitioning algorithm
parallel hardware