Alternating Path and Coloured Clustering

Leizhen CAI, On Yin LEUNG

In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends…