Usage: ./isomorphic {graph_A} {graph_B} where graph_A and graph_B are file paths. The graph files should have the following format. See the Test directory for examples. {num_vertices} {edge_1_vert_1} ...

You will see the generated graphs at graphs2 dir. Also there will be a file nauty_times.txt with execution times of nauty to solve the isomorphism. To solve an instance of the problem with our code: ...

Deciding whether two graphs are structurally identical, or isomorphic, is a classical algorithmic problem that has been studied since the early days of computing. Applications span a broad field of ...

Abstract: Graph isomorphism is an essential problem in graph theory and widely used in a variety of applications. With graph size increasing, graph isomorphism become difficult for classical ...

The graph isomorphism problem remains one of those mysteries in theoretical computer science that fascinates laypersons and experts alike. In 1979, Garey and Johnson mentioned the problem in their ...

Abstract: A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be ...

Given two graphs which are almost isomorphic, is it possible to find a bijection which preserves most of the edges between the two? This is the algorithmic task of Robust Graph Isomorphism, which is a ...

Just five days after posting a retraction, László Babai announced that he had fixed the error in his landmark graph isomorphism algorithm. The back and forth ...