Algebraic Graph Theory Seminar - Martin Mačaj (9.11.2018)
[Translate to English:] v piatok 9.11.2018 o 13:30 hod. v miestnosti M/XI
By: Martin Mačaj
Association schemes, coherent configurations and Weisfeiler-Leman stabilization
Association schemes and coherent configurations form special classes of color (di)graphs, with important applications in graph theory, group theory, statistics, coding theory ...
Weisfeiler-Leman stabilization is a polynomial time algorithm which, given a color graph $S$, provides smallest coherent configuration $S'$ such that each color class of $S$ is union of classes of $S'$.
In this talk we recall basic properties of association schemes and coherent configurations and we present Weisfeiler-Leman stabilization.