Erratum to: A polynomial-time algorithm for simple undirected graph isomorphism (Concurrency and Computation: Practice and Experience, (2021), 33, 7, (1), 10.1002/cpe.5484)

He, J; Huang, Guangyan; Cao, J; Zhang, Z; Zheng, H; Zhang, P; Zarei, R; Susanto, F; Wang, R; Ji, Y; Fan, W; Xie, Z; Wang, X; Guo, M; Chi, CH; Zhang, J; Li, Y; Chen, X; Shi, Y; Van Zundert, A

Erratum to: A polynomial-time algorithm for simple undirected graph isomorphism (Concurrency and Computation: Practice and Experience, (2021), 33, 7, (1), 10.1002/cpe.5484)

Version 2 2024-06-03, 06:58

Version 1 2021-10-11, 08:18

journal contribution

posted on 2024-06-03, 06:58 authored by J He, Guangyan HuangGuangyan Huang, J Cao, Z Zhang, H Zheng, P Zhang, R Zarei, F Susanto, R Wang, Y Ji, W Fan, Z Xie, X Wang, M Guo, CH Chi, J Zhang, Y Li, X Chen, Y Shi, A Van Zundert

Erratum to: A polynomial-time algorithm for simple undirected graph isomorphism (Concurrency and Computation: Practice and Experience, (2021), 33, 7, (1), 10.1002/cpe.5484)

History

Journal

Concurrency and Computation: Practice and Experience

Volume

34

Article number

ARTN e6599

Publisher DOI

https://doi.org/10.1002/cpe.6599

Open access

Yes

Link to full text

http://doi.org/10.1002/cpe.6599

ISSN

1532-0626

eISSN

1532-0634

Language

English

Publication classification

CN Other journal article

Issue

3

Publisher

WILEY

Usage metrics

Keywords

Science & Technology Technology Computer Science, Software Engineering Computer Science, Theory & Methods Computer Science 4613 Theory of computation

Licence

Exports

RefWorks

BibTeX

Ref. manager

Endnote

DataCite

NLM

DC

Erratum to: A polynomial-time algorithm for simple undirected graph isomorphism (Concurrency and Computation: Practice and Experience, (2021), 33, 7, (1), 10.1002/cpe.5484)

History

Journal

Volume

Article number

Publisher DOI

Open access

Link to full text

ISSN

eISSN

Language

Publication classification

Issue

Publisher

Usage metrics

Categories

Keywords

Licence

Exports