AI Chat AI Image Generator AI Video Text to Speech

The probabilistic Weisfeiler-Leman algorithm

12/24/2021

∙

by Saveliy V. Skresanov, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 05/12/2022

Bottleneck Matching in the Plane

We present an algorithm for computing a bottleneck matching in a set of ...

0 Matthew J. Katz, et al. ∙

research

∙ 11/18/2020

Engineering a Fast Probabilistic Isomorphism Test

We engineer a new probabilistic Monte-Carlo algorithm for isomorphism te...

0 Markus Anders, et al. ∙

research

∙ 04/17/2021

Approximate Triangle Counting via Sampling and Fast Matrix Multiplication

There is a trivial O(n^3/T) time algorithm for approximate triangle coun...

0 Jakub Tětek, et al. ∙

research

∙ 10/18/2018

Solving Linear Programs in the Current Matrix Multiplication Time

This paper shows how to solve linear programs of the form _Ax=b,x≥0 c^ x...

0 Michael B. Cohen, et al. ∙

research

∙ 12/24/2019

An algorithm to evaluate the spectral expansion

Assume that X is a connected (q+1)-regular undirected graph of finite or...

0 Hau-Wen Huang, et al. ∙

research

∙ 12/24/2019

Counting the geodesic cycles of a given length

Assume that X is a connected regular undirected graph of finite order n....

0 Hau-Wen Huang, et al. ∙

research

∙ 11/03/2019

Cryptanalysis of a new version of the MOR scheme

We show that an attack based on the linear decomposition method introduc...

0 Vitaly Roman'kov, et al. ∙