Analyzing the performance of greedy maximal scheduling via local pooling and graph theory

Keyphrases

• Graph Theory 100%
• Maximal Scheduling 100%
• Local Pooling 100%
• Local Graph 100%
• Graph Theoretic Approach 40%
• Pooling Condition 40%
• Greedy Algorithm 20%
• Greedy Scheduling Algorithm 20%
• Input-queued Switch 20%
• Bipartite Graph 20%
• Interference Constraint 20%
• Primary Interference 20%
• Interference Graph 20%
• Wireless Networks 20%
• Graph Network 20%
• Wireless Switch 20%
• Efficient Operation 20%
• Network Topology 20%
• Linear-time Algorithm 20%
• Distributed Scheduling Algorithm 20%

Computer Science

• Scheduling Algorithm 100%
• Graph Theory 100%
• Wireless Networks 50%
• Greedy Algorithm 50%
• Interference Graph 50%
• Bipartite Graph 50%
• Efficient Operation 50%
• Network Topology 50%
• Distributed Scheduling 50%