= Colour refinement algorithm
{wiki=Colour_refinement_algorithm}
The Colour Refinement algorithm is a technique used primarily in graph theory for graph isomorphism testing. It is designed to distinguish non-isomorphic graphs by refining the partition of the vertex set based on the "color" or label of the vertices, which can be thought of as their connectivity characteristics. The algorithm works by iteratively refining these colors until no further refinements are possible, leading to a stable partition of the vertices. \#\#\# Overview of the Colour Refinement Algorithm 1.
Back to article page
