Skip to main content

Next generation algorithms for grabbing and exploiting symmetry

Searching for OpenAIRE data...


Engineering a Fast Probabilistic Isomorphism Test

Author(s): Markus Anders, Pascal Schweitzer
Published in: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), 2021, Page(s) 73-84
DOI: 10.1137/1.9781611976472.6

2.5-Connectivity: Unique Components, Critical Graphs, and Applications

Author(s): Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
Published in: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Issue 12301, 2020, Page(s) 352-363
DOI: 10.1007/978-3-030-60440-0_28

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm

Author(s): Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Page(s) 1-13
DOI: 10.1109/lics.2019.8785694

On the Weisfeiler-Leman Dimension of Finite Groups

Author(s): Jendrik Brachter, Pascal Schweitzer
Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, Page(s) 287-300
DOI: 10.1145/3373718.3394786

A unifying method for the design of algorithms canonizing combinatorial objects

Author(s): Pascal Schweitzer, Daniel Wiebking
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1247-1258
DOI: 10.1145/3313276.3316338