Covariate-assisted graph matching
The authors developed two methods for graph matching that use extra information, called covariates (like node and edge features), to improve alignment accuracy between networks. They propose a global method based on a Quadratic Assignment Problem (QAP) and a faster local method using seed neighborhoods. The results show these methods can match more nodes correctly than traditional techniques, proving the value of incorporating auxiliary data.