On the Use of Randomness in Local Distributed Graph Algorithms.

Mohsen Ghaffari Fabian Kuhn

Published in: PODC (2019)

Keyphrases

graph theory
genetic algorithm
distributed systems
connected components
data sets
social networks
data structure
computational complexity
significant improvement
np hard
random walk
computationally efficient
theoretical analysis
distributed environment
bipartite graph
graph layout