The Graph Isomorphism Algorithm: Graph Isomorphism is in P - Brossura

Dharwadker, Ashay; Tevet, John-Tagore

Brossura

ISBN 10: 1466394374 ISBN 13: 9781466394377

Casa editrice: CreateSpace Independent Publishing Platform, 2011

Riassunto

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.

Dettagli dell'edizione

• Editore: CreateSpace Independent Publishing Platform
• Data di pubblicazione: 2011
• Lingua: Inglese
• ISBN 10: 1466394374
• ISBN 13: 9781466394377
• Rilegatura: Copertina flessibile
• Numero di pagine: 38
• Contatto del produttore: non disponibile
• Persona responsabile: Yeepin GmbH; 492000000000; sunshine12232@outlook.com; ; Alleestr.11; Kaiserslautern; Rheinland-Pfalz; 67655; Germania