Year: 2021
Type: preprint
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(n^{1+ω}\log^2 n) $, where $ n $ is the number of vertices of the graph and $ ω< 2.273 $ is the matrix multiplication exponent.
Source: arXiv (Cornell University)
Author: Skresanov, Saveliy V.
Institution: Sobolev Institute of Mathematics
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G3776982894, G6444257319
OpenAlex ID: W4226217971