Graph coarsening. A maximal matching of size three on G0. Each edge in the matching is removed and its endpoints are merged into a single supernode in a new coarsened graph G1. Edges b. and c. have the same supernode endpoints and are merged into a single edge. The sum of the edge weights for b and c is assigned to the merged edge. Graph coarsening is repeated on G1 to produce G2.