List Price:
$15.00
Add to Cart
www.dharwadker.org

The Graph Isomorphism Algorithm
Graph Isomorphism is in P
Authored by
Ashay Dharwadker, JohnTagore Tevet
We present a new polynomialtime 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 polynomialtime, 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 polynomialtime 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.
 Publication Date:
 20111002
 ISBN/EAN13:
 1466394374 / 9781466394377
 Page Count:
 38
 Binding Type:
 US Trade Paper
 Trim Size:
 8.5" x 11"
 Language:
 English
 Color:
 Full Color
 Related Categories:
 Computers / Computer Science
