Search
Now showing items 1-1 of 1
A heuristic algorithm for graph isomorphism
(Texas A&M University, 1999)
To devise a good algorithm for determining if two graphs are isomorphic, is of considerable practical importance, and is also of great theoretical interest due to its relationship to the concept of NP-completeness. There ...