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: ...

Graphs are a ubiquitous mathematical abstraction used in numerous problems in science and engineering. Of particular importance is the need to find the best structure-preserving matching of graphs.

An innovative approach to solving a stubborn, but elementary, question in graph theory — the mathematical study of networks of nodes and their connections — may signal the first major theoretical ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

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 ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

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 ...