Figure 5
Comparison between a matching returned by the greedy algorithm and an optimal matching. All links in the graph have the same weight, and links included in each matching are marked in red. The greedy algorithm may schedule link 
at the center of the graph while it is possible to schedule 
links at the same time.A matching returned by the greedy algorithmAn optimal matching