Adaptive Runtime Features for Distributed Graph Algorithms.
Jesun Sahariar FirozMarcin ZalewskiJoshua SuetterleinAndrew LumsdainePublished in: HiPC (2018)
Keyphrases
- graph theory
- interesting features
- learning algorithm
- data structure
- benchmark datasets
- significant improvement
- computationally efficient
- computational cost
- classification accuracy
- feature extraction
- optimization problems
- low level
- computational complexity
- feature set
- worst case
- peer to peer
- evolutionary algorithm
- connected components
- feature selection algorithms
- graph theoretic
- graph search
- adaptive algorithms
- cooperative
- maximum clique