{ "item_title" : "The Graph Isomorphism Algorithm", "item_author" : [" John-Tagore Tevet", "Ashay Dharwadker "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/46/639/437/1466394374_b.jpg", "price_data" : { "retail_price" : "15.00", "online_price" : "15.00", "our_price" : "15.00", "club_price" : "15.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details