3 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
Jarek Duda
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For exa…