A heuristic algorithm for graph isomorphism /

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 is no known algorithm that determines if two graphs are or are not isomorphic t...

Full description

Bibliographic Details

Main Author:	Torres Navarro, Luz
Format:	Thesis eBook
Language:	English
Published:	[Place of publication not identified] : [publisher not identified] ; 1999.
Subjects:	Major computer science.
Online Access:	Link to OAKTrust copy