Algorithmic Aspects of Homophyly of Networks

Angsheng Li, Peng Zhang

We investigate the algorithmic problems of the {\it homophyly phenomenon} in networks. Given an undirected graph $G=(V,E)$ and a vertex coloring $c \colon V \rightarrow {1, 2, .…