11 citations · 61 across the 16 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…
cs.DS2018★ 11 cited
A Faster Isomorphism Test for Graphs of Small Degree
Martin Grohe, Daniel Neuen, Pascal Schweitzer
In a recent breakthrough, Babai (STOC 2016) gave a quasipolynomial time graph isomorphism test. In this work, we give an improved isomorphism test for graphs of small degree: our a…