On the Complexity of Local Distributed Graph Problems.
Mohsen GhaffariFabian KuhnYannic MausPublished in: CoRR (2016)
Keyphrases
- decision problems
- distributed systems
- meeting scheduling
- optimization problems
- computational cost
- np complete
- application domains
- problems involving
- distributed environment
- tractable cases
- social networks
- polynomial time complexity
- polynomial hierarchy
- solving problems
- directed acyclic graph
- graph structure
- graph matching
- directed graph
- space complexity
- combinatorial optimization
- graph representation
- lightweight
- graph theoretic
- np hardness
- computational issues
- peer to peer
- worst case
- knn
- computational complexity