Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Bernard RiesPublished in: ICORES (2015)
Keyphrases
- graph theory
- complex networks
- graph theoretical
- computer vision and pattern recognition
- scheduling problem
- social network analysis
- graph theoretic
- search algorithm
- greedy algorithm
- scheduling algorithm
- minimum spanning tree
- automata theory
- graph based representations
- feature selection
- dynamic programming
- document similarity
- combinatorial optimization
- optimization problems
- greedy heuristic
- graph properties
- maximum independent set