6 citations · 10 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
A unifying method for the design of algorithms canonizing combinatorial objects
Pascal Schweitzer, Daniel Wiebking
We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, h…
cs.DS2018
An improved isomorphism test for bounded-tree-width graphs
Martin Grohe, Daniel Neuen, Pascal Schweitzer +1
We give a new fpt algorithm testing isomorphism of -vertex graphs of tree width in time , improving the fpt algorithm…