11 citations · 61 across the 16 of their papers we have counts for
1 paper · 2 filters
Daniel Neuen
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from in…