tailieunhanh - Maximal assortative matching for real-world network graphs, random network graphs and scale-free network graphs

The MAM algorithm prefers to include the edge with the smallest assortativity weight (the assortative weight of the edges is updated for each iteration) until all the edges in the graph are covered. | Maximal assortative matching for real-world network graphs, random network graphs and scale-free network graphs