A polynomial‐time algorithm for simple undirected graph isomorphism

Summary The graph isomorphism problem is to determine two finite graphs that are isomorphic which is not known with a polynomial‐time solution. This paper solves the simple undirected graph isomorphism problem with an algorithmic approach as NP=P and proposes a polynomial‐time solution to check if t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Concurrency and computation Jg. 33; H. 7; S. 1
Hauptverfasser:	He, Jing, Chen, Jinjun, Huang, Guangyan, Cao, Jie, Zhang, Zhiwang, Zheng, Hui, Zhang, Peng, Zarei, Roozbeh, Sansoto, Ferry, Wang, Ruchuan, Ji, Yimu, Fan, Weibei, Xie, Zhijun, Wang, Xiancheng, Guo, Mengjiao, Chi, Chi‐Hung, Souza, Paulo A., Zhang, Jiekui, Li, Youtao, Chen, Xiaojun, Shi, Yong, Green, David, Kersi, Taraporewalla, Van Zundert, André
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 10.04.2021
Schlagworte:	Algorithms Arrays equivalence between permutation and bijection graph isomorphism Graphical representations Graphs Isomorphism Mathematical analysis Matrix methods Multiplication Permutations Polynomials polynomial‐time solution reflexivity and duality simple undirected graph Theorems vertex/edge adjacency matrix
ISSN:	1532-0626, 1532-0634
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!