Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems.
Will RosenbaumJukka SuomelaPublished in: CoRR (2019)
Keyphrases
- decision problems
- polynomial hierarchy
- evolutionary algorithm
- shortest path problem
- np complete
- random walk
- solving problems
- polynomial time complexity
- neural network
- computational issues
- graph representation
- problems involving
- benchmark problems
- graph matching
- structured data
- optimization problems
- computational complexity
- decision trees
- feature selection