TCS lab seminar:"Weisfeiler–Leman algorithm in space. Part 2"
The laboratory will have the next seminar online on Wednesday, March 22, 18:10. It's the second part of the talk. The first part of the talk was on our seminar on March 15.
Title: Weisfeiler–Leman algorithm in space. Part 2.
Speaker: Alexander Kozachinskiy
Abstract: The Weisfeiler–Leman algorithm is a family of (incomplete) graph isomorphism tests having interesting connections to logic, fractional isomorphisms, tree-width, and etc. We study the power of this algorithm on distance graphs of sets of points in R^d.