Article,
A polynomial-time algorithm for simple undirected graph isomorphism.
J. He, J. Chen, G. Huang, J. Cao, Z. Zhang, H. Zheng, P. Zhang, R. Zarei, F. Sansoto, R. Wang, Y. Ji, W. Fan, Z. Xie, X. Wang, M. Guo, C. Chi, P. de Souza, J. Zhang, Y. Li, X. Chen, Y. Shi, D. Green, T. Kersi, and A. Zundert.Concurr. Comput. Pract. Exp., 33 (7): 1 (2021)
Meta data
- BibTeX key
- journals/concurrency/HeCHCZZZZSWJFXW21
- entry type
- article
- year
- 2021
- journal
- Concurr. Comput. Pract. Exp.
- number
- 7
- pages
- 1
- volume
- 33
- ee
- https://doi.org/10.1002/cpe.5484
- url
- http://dblp.uni-trier.de/db/journals/concurrency/concurrency33.html#HeCHCZZZZSWJFXW21
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Journal Article
%1 journals/concurrency/HeCHCZZZZSWJFXW21
%A He, Jing
%A Chen, Jinjun
%A Huang, Guangyan
%A Cao, Jie
%A Zhang, Zhiwang
%A Zheng, Hui
%A Zhang, Peng
%A Zarei, Roozbeh
%A Sansoto, Ferry
%A Wang, Ruchuan
%A Ji, Yimu
%A Fan, Weibei
%A Xie, Zhijun
%A Wang, Xiancheng
%A Guo, Mengjiao
%A Chi, Chi-Hung
%A de Souza, Paulo A.
%A Zhang, Jiekui
%A Li, Youtao
%A Chen, Xiaojun
%A Shi, Yong
%A Green, David
%A Kersi, Taraporewalla
%A Zundert, André Van
%D 2021
%J Concurr. Comput. Pract. Exp.
%K dblp
%N 7
%P 1
%T A polynomial-time algorithm for simple undirected graph isomorphism.
%U http://dblp.uni-trier.de/db/journals/concurrency/concurrency33.html#HeCHCZZZZSWJFXW21
%V 33
@article{journals/concurrency/HeCHCZZZZSWJFXW21,
added-at = {2024-08-05T00:00:00.000+0200},
author = {He, Jing and Chen, Jinjun and Huang, Guangyan and Cao, Jie and Zhang, Zhiwang and Zheng, Hui and Zhang, Peng and Zarei, Roozbeh and Sansoto, Ferry and Wang, Ruchuan and Ji, Yimu and Fan, Weibei and Xie, Zhijun and Wang, Xiancheng and Guo, Mengjiao and Chi, Chi-Hung and de Souza, Paulo A. and Zhang, Jiekui and Li, Youtao and Chen, Xiaojun and Shi, Yong and Green, David and Kersi, Taraporewalla and Zundert, André Van},
biburl = {https://www.bibsonomy.org/bibtex/2958e98f63c284c90459504eee67c1191/dblp},
ee = {https://doi.org/10.1002/cpe.5484},
interhash = {fa10e9bee2e1c1b3ba0bfa5dc22171df},
intrahash = {958e98f63c284c90459504eee67c1191},
journal = {Concurr. Comput. Pract. Exp.},
keywords = {dblp},
number = 7,
pages = 1,
timestamp = {2024-08-12T07:02:29.000+0200},
title = {A polynomial-time algorithm for simple undirected graph isomorphism.},
url = {http://dblp.uni-trier.de/db/journals/concurrency/concurrency33.html#HeCHCZZZZSWJFXW21},
volume = 33,
year = 2021
}