On the Use of Randomness in Local Distributed Graph Algorithms.
Mohsen GhaffariFabian KuhnPublished in: CoRR (2019)
Keyphrases
- graph theory
- cooperative
- data structure
- computational cost
- orders of magnitude
- breadth first search
- graph representation
- theoretical analysis
- computational complexity
- computationally efficient
- benchmark datasets
- distributed systems
- data mining algorithms
- connected components
- bipartite graph
- significant improvement
- graph search
- learning algorithm