Round- and Message-Optimal Distributed Graph Algorithms.
Bernhard HaeuplerD. Ellis HershkowitzDavid WajcPublished in: PODC (2018)
Keyphrases
- graph theory
- partitioning algorithm
- cooperative
- worst case
- theoretical analysis
- computationally efficient
- learning algorithm
- computational cost
- data structure
- multi agent
- dynamic programming
- significant improvement
- peer to peer
- data mining techniques
- computational complexity
- structured data
- optimal solution
- random graphs
- depth first search