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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Concurrency and computation Ročník 33; číslo 7; s. 1
Hlavní autoři:	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é
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken Wiley Subscription Services, Inc 10.04.2021
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!