Title:
Approaches to Solving the Graph Isomorphism Problem
Approaches to Solving the Graph Isomorphism Problem
| dc.contributor.author | Eikenberry, Jordy | en_US |
| dc.date.accessioned | 2005-06-17T17:36:00Z | |
| dc.date.available | 2005-06-17T17:36:00Z | |
| dc.date.issued | 2004 | en_US |
| dc.description.abstract | In this paper I propose a polynomial time algorithm for the Graph Isomorphism problem, which always returns a correct answer in the case that the input graphs are non-cospectral or isomorphic. Although I have no correctness proof in the general case, I suspect that most if not all inputs return a correct answer after the execution of my algorithm. This paper assumes no previous knowledge of the problem itself, however a basic understanding of Theoretical Computer Science is assumed. Explained in this paper are the techniques and approaches to breaking down this problem into something that is more manageable. Finally, I discuss problems relating to Graph Isomorphism that remain open at the time of writing this paper. | en_US |
| dc.format.extent | 224271 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/6494 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.relation.ispartofseries | CC Technical Report; GIT-CC-04-09 | en_US |
| dc.subject | Graph Isomorphism | |
| dc.subject | Polynomial time algorithms | |
| dc.title | Approaches to Solving the Graph Isomorphism Problem | en_US |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 |
Files
Original bundle
1 - 1 of 1