Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory