11 citations · 61 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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…