Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Berk BirandMaria ChudnovskyBernard RiesPaul D. SeymourGil ZussmanYori ZwolsPublished in: IEEE/ACM Trans. Netw. (2012)
Keyphrases
- graph theory
- graph theoretical
- scheduling problem
- computer vision and pattern recognition
- social network analysis
- greedy algorithm
- minimum spanning tree
- complex networks
- search algorithm
- graph theoretic
- scheduling algorithm
- graph based representations
- document similarity
- dynamic programming
- genetic algorithm
- pattern recognition
- graph properties
- maximum independent set
- upper bound
- protein structure prediction
- maximal cliques
- computational complexity
- feature selection