NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
A heuristic algorithm for graph isomorphism
| dc.creator | Torres Navarro, Luz | |
| dc.date.accessioned | 2012-06-07T22:57:52Z | |
| dc.date.available | 2012-06-07T22:57:52Z | |
| dc.date.created | 1999 | |
| dc.date.issued | 1999 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1999-THESIS-T67 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references (leaves 84-86). | en |
| dc.description | Issued also on microfiche from Lange Micrographics. | en |
| dc.description.abstract | 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 that runs in polynomial time, i.e., it is not known if graph isomorphism is in P. On the other hand, graph isomorphism [] NP but no one has shown that it is NP-complete. In this thesis we will give a polynomial time algorithm O(n⁵), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our algorithm fails) will be so rare that ISO-MT can be safely used for any practical application. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | computer science. | en |
| dc.subject | Major computer science. | en |
| dc.title | A heuristic algorithm for graph isomorphism | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | computer science | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.