6 citations · 8 across the 4 of their papers we have counts for
3 papers · 1 filter
A Characterization of Individualization-Refinement Trees
Markus Anders, Jendrik Brachter, Pascal Schweitzer
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in gener…
Parallel Computation of Combinatorial Symmetries
Markus Anders, Pascal Schweitzer
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetri…
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…