DeepAI AI Chat
Log In Sign Up

Engineering a Fast Probabilistic Isomorphism Test

by   Markus Anders, et al.

We engineer a new probabilistic Monte-Carlo algorithm for isomorphism testing. Most notably, as opposed to all other solvers, it implicitly exploits the presence of symmetries without explicitly computing them. We provide extensive benchmarks, showing that the algorithm outperforms all state-of-the-art solutions for isomorphism testing on most inputs from the de facto standard benchmark library for isomorphism testing. On many input types, our data not only show improved running times by an order of magnitude, but also reflect a better asymptotic behavior. Our results demonstrate that, with current algorithms, isomorphism testing is in practice easier than the related problems of computing the automorphism group or canonically labeling a graph. The results also show that probabilistic algorithms for isomorphism testing can be engineered to outperform deterministic approaches, even asymptotically.


page 1

page 2

page 3

page 4


The probabilistic Weisfeiler-Leman algorithm

A probabilistic version of the Weisfeiler-Leman algorithm for computing ...

Automatic Alignment of Sequential Monte Carlo Inference in Higher-Order Probabilistic Programs

Probabilistic programming is a programming paradigm for expressing flexi...

Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations

Most classical scheduling formulations assume a fixed and known duration...

Note on generalized group testing

In this note, we present a new adaptive algorithm for generalized group ...

Parallel Computation of Combinatorial Symmetries

In practice symmetries of combinatorial structures are computed by trans...

Group Testing with Non-identical Infection Probabilities

We consider a zero-error probabilistic group testing problem where indiv...

Multilevel Skeletonization Using Local Separators

In this paper we give a new, efficient algorithm for computing curve ske...