9 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.DS2017★ 9 cited
Benchmark Graphs for Practical Graph Isomorphism
Daniel Neuen, Pascal Schweitzer
The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs witho…
cs.CC2017
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism
Daniel Neuen, Pascal Schweitzer
The individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers a…
math.GR2016
Subgroups of 3-factor direct products
Daniel Neuen, Pascal Schweitzer
Extending Goursat's Lemma we investigate the structure of subdirect products of 3-factor direct products. We give several example constructions and then provide a structure theorem…