1 paper · 1 filter
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…