64 citations · 346 across the 53 of their papers we have counts for
1 paper · 2 filters
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…