Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing complexity of the graphs increased the algorithm's running time ...

Minor-Free Graph: A graph that does not contain a specified smaller graph (minor) as a subgraph, which is critical for certifying graph classes and in achieving computational optimisations.