A re-coloring approach for graph b-coloring based clustering

A Semi-Supervised Clustering Method Based on Graph Contraction and Spectral Graph Theory

“…Various graph-theoretic clustering approaches have been proposed to find subsets of vertices in a graph based on the edges among the vertices. Several methods utilizes graph coloring techniques (Guënoche et al, 1991;Yoshida & Ogino, 2011). Other methods are based on the flow or cut in graph, such as spectral clustering (von Luxburg, 2007).…”

New Frontiers in Graph Theory

“…Various graph-theoretic clustering approaches have been proposed to find subsets of vertices in a graph based on the edges among the vertices. Several methods utilizes graph coloring techniques (Guënoche et al, 1991;Yoshida & Ogino, 2011). Other methods are based on the flow or cut in graph, such as spectral clustering (von Luxburg, 2007).…”