3 ms·

Most real life instances of Graph Isomorphism are easily solved in polynomial time though...

• johncolanduoni 11y ago
  Yes, they discussed in the comment section of the post that when theoretical computer science researchers have tried to find actual graphs which existing algorithms do not handle well, they had difficulties finding them outside of some very specific (and vanishingly small) classes.