The probabilistic Weisfeiler-Leman algorithm
Abstract
A probabilistic version of the Weisfeiler-Leman algorithm for computing the coherent closure of a colored graph is suggested. The algorithm is Monte Carlo and runs in time O(n1+ω2 n) , where n is the number of vertices of the graph and ω < 2.273 is the matrix multiplication exponent.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.