30% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

The Graph Isomorphism Algorithm Graph Isomorphism is in P - Ashay Dharwadker,John-Tagore Tevet

English
2009-08-08
€18.54 €26.49

-30% with code BOOKS

In stock at our supplier

Shipping in 10-16 days

30-day return policy

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 ... Full description

You May Also Like

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.

More Information

Author Ashay Dharwadker, John-Tagore Tevet
Publisher Institute of Mathematics
Release year 2009
Cover type Softcover
EAN 9781466394377
Write Your Own Review
You're reviewing: The Graph Isomorphism Algorithm Graph Isomorphism is in P
Your Rating:

Goodreads Reviews

€18.54 €26.49