TCS lab seminar:"Weisfeiler–Leman algorithm in space. Part 1"
Event ended
Seminar's video
The laboratory will have the next seminar online on Wednesday, March 15, 18:10. It's the first part of the talk. The second part of the talk will be on our next seminar on March 22.
Title: Weisfeiler–Leman algorithm in space
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.
Date
15 March
18:10