1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Simon Raßmann, Pascal Schweitzer
The tournament isomorphism problem is one of the two fundamental bottlenecks to designing better algorithms for the graph isomorphism problem. Though the problem has been investiga…