University of Twente Student Theses


Graph Isomorphism with Pathfinding Algorithms

Breggeman, F.T. (2020) Graph Isomorphism with Pathfinding Algorithms.

[img] PDF
Abstract: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.
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science BSc (56964)
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page