20 citations · 39 across the 9 of their papers we have counts for
1 paper · 1 filter
Harm Derksen
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algo…