Graph Isomorphism with Pathfinding Algorithms

This paper presents exploratory research into the use of pathfinding algorithms to solve the graph isomorphism problem, where the pathfinding algorithms will be used to turn isomorphic graphs into isomorphic trees. A frame- work for testing such algorithms has been developed and several algorithms have been tested using this framework. The algorithms are proven to be in polynomial time, and the class of graphs on which they provide correct answers is discussed. (https://doi.org/10.5281/zenodo.3911824)