16 citations · 52 across the 11 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
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.DS2015
Using Contracted Solution Graphs for Solving Reconfiguration Problems
Paul Bonsma, Daniel Paulusma
We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solu…