49 citations · 118 across the 24 of their papers we have counts for
1 paper · 2 filters
Pavel Klavik, Dušan Knop, Peter Zeman
The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs G and H, it asks whether they are the same up to a rel…