6 citations · 8 across the 4 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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…