Jump to content

Colour refinement algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fschwarzentruber (talk | contribs) at 12:25, 12 September 2022 (←Created page with '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 or not<ref>{{Cite web |url=https://direct.mit.edu/books/edited-volume/5150/chapter-abstract/3403134/Color-Refinement-and-Its-Applications?redirectedFrom=full...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 or not[1].

  1. ^ direct.mit.edu https://direct.mit.edu/books/edited-volume/5150/chapter-abstract/3403134/Color-Refinement-and-Its-Applications?redirectedFrom=fulltext. Retrieved 2022-09-12. {{cite web}}: Missing or empty |title= (help)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Colour_refinement_algorithm&oldid=1109893984"