274 citations · 1.8k across the 48 of their papers we have counts for
1 paper · 2 filters
Stefan Klus, Patrick Gelß
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degr…