Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces.
Luke PostlePublished in: FOCS (2019)
Keyphrases
- computationally efficient
- computationally intensive
- computationally expensive
- graph theory
- data structure
- significant improvement
- worst case
- distributed environment
- cooperative
- query processing
- optimization problems
- data mining techniques
- lightweight
- distributed systems
- dynamic graph
- peer to peer
- learning algorithm
- computational complexity
- social networks