1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Adria Alcala Mena
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M.…