Analyzing the performance of greedy maximal scheduling via local pooling and graph theory.
Berk BirandMaria ChudnovskyBernard RiesPaul D. SeymourGil ZussmanYori ZwolsPublished in: S3@MobiCom (2010)
Keyphrases
- graph theory
- scheduling problem
- graph theoretical
- social network analysis
- graph theoretic
- computer vision and pattern recognition
- graph based representations
- document similarity
- greedy algorithm
- complex networks
- scheduling algorithm
- automata theory
- minimum spanning tree
- combinatorial optimization
- maximum independent set
- search algorithm
- protein structure prediction
- maximal cliques
- cost function
- pattern recognition
- graph properties