Maximal assortative matching for complex

We define the problem of maximal assortativity matching (MAM) for a complex network graph as the problem of maximizing the similarity of the end vertices (with respect to some measure of node weight) constituting the matching. In this pursuit, we introduce a metric called the assortativity weight of...

Full description

Bibliographic Details

Published in:	Journal of King Saud University: Computer and Information Sciences
Main Author:	Natarajan Meghanathan
Format:	Article
Language:	English
Published:	Springer 2016-04-01
Subjects:	Maximal matching Assortative matching Dissortative matching Assortativity index Complex networks Node similarity
Online Access:	http://www.sciencedirect.com/science/article/pii/S1319157815001238