Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Berk BirandMaria ChudnovskyBernard RiesPaul D. SeymourGil ZussmanYori ZwolsPublished in: INFOCOM (2010)
Keyphrases
- graph theory
- graph theoretical
- scheduling algorithm
- graph theoretic
- computer vision and pattern recognition
- social network analysis
- scheduling problem
- greedy algorithm
- automata theory
- complex networks
- graph based representations
- search algorithm
- maximum independent set
- minimum spanning tree
- document similarity
- maximal cliques
- feature selection
- combinatorial optimization
- dynamic programming
- search space
- pairwise
- greedy heuristic
- graph properties
- face recognition