On the performance of greedy forwarding on Yao and Theta graphs.
Weisheng SiQuincy TseGuoqiang MaoAlbert Y. ZomayaPublished in: J. Parallel Distributed Comput. (2018)
Keyphrases
- greedy algorithm
- search algorithm
- worst case
- graph matching
- graph theoretic
- feature selection
- directed graph
- search space
- series parallel
- graph partitioning
- graph representation
- forward selection
- neural network
- greedy algorithms
- greedy heuristic
- random graphs
- graph clustering
- graph model
- weighted graph
- graph structure
- graph theory
- dynamic programming