1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2021
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case
Markus Anders, Pascal Schweitzer, Florian Wetzels
Color refinement is a crucial subroutine in symmetry detection in theory as well as practice. It has further applications in machine learning and in computational problems from lin…
cs.DS2020
Engineering a Fast Probabilistic Isomorphism Test
Markus Anders, Pascal Schweitzer
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 with…
cs.DS2020★ 1 cited
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms
Markus Anders, Pascal Schweitzer
We define a search problem on trees that closely captures the backtracking behavior of all current practical graph isomorphism algorithms. Given two trees with colored leaves, the…