274 citations · 1.8k across the 48 of their papers we have counts for
1 paper · 2 filters
Wenjie Xiao, Mathieu Besançon, Patrick Gelß +3
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be so…