"A polynomial-time algorithm for simple undirected graph isomorphism."

Jing He et al. (2021)

> Home

Details and statistics

DOI: 10.1002/CPE.5484

access: closed

type: Journal Article

metadata version: 2025-02-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/concurrency/HeCHCZZZZSWJFXW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/HeCHCZZZZSWJFXW21
Jing He, Jinjun Chen, Guangyan Huang, Jie Cao, Zhiwang Zhang, Hui Zheng, Peng Zhang, Roozbeh Zarei, Ferry Sansoto, Ruchuan Wang, Yimu Ji, Weibei Fan, Zhijun Xie, Xiancheng Wang, Mengjiao Guo, Chi-Hung Chi, Paulo A. de Souza, Jiekui Zhang, Youtao Li, Xiaojun Chen, Yong Shi, David Green, Taraporewalla Kersi, André Van Zundert:
A polynomial-time algorithm for simple undirected graph isomorphism. Concurr. Comput. Pract. Exp. 33(7): 1 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.