The Graph Isomorphism Algorithm
Author | : Ashay Dharwadker |
Publisher | : Institute of Mathematics |
Total Pages | : 42 |
Release | : 2009-08-08 |
ISBN-10 | : 9781466394377 |
ISBN-13 | : 1466394374 |
Rating | : 4/5 (77 Downloads) |
Download or read book The Graph Isomorphism Algorithm written by Ashay Dharwadker and published by Institute of Mathematics. This book was released on 2009-08-08 with total page 42 pages. Available in PDF, EPUB and Kindle. Book excerpt: We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the algorithm is necessary and sufficient for solving the Graph Isomorphism Problem in polynomial-time, thus showing that the Graph Isomorphism Problem is in P. The semiotic theory for the recognition of graph structure is used to define a canonical form of the sign matrix of a graph. We prove that the canonical form of the sign matrix is uniquely identifiable in polynomial-time for isomorphic graphs. The algorithm is demonstrated by solving the Graph Isomorphism Problem for many of the hardest known examples. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.