{"version":"1.0","type":"link","title":"Colour refinement algorithm - Newikis","description":"In graph theory and theoretical computer science, the colour refinement algorithm also known as the naive vertex classification, or the 1-dimensional version of the Weisfeiler-Leman algorithm, is a routine used for testing whether two graphs are isomorphic. While it solves graph isomorphism on…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}