6 citations · 16 across the 14 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Christoph Berkholz, Paul Bonsma, Martin Grohe
An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to f…
cs.CC2015
Limitations of Algebraic Approaches to Graph Isomorphism Testing
Christoph Berkholz, Martin Grohe
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gröbner basis computation. The idea of these algorithms is to encode two graph…