6 citations · 16 across the 14 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
A dichotomy for succinct representations of homomorphisms
Christoph Berkholz, Harry Vinall-Smeeth
The task of computing homomorphisms between two finite relational structures and is a well-studied question with numerous applications. Since the set $\…
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…