Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs - Comment

Citation
Bt. Fan et al., Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomial-time for molecular graphs - Comment, J CHEM INF, 39(3), 1999, pp. 630-631
Citations number
3
Categorie Soggetti
Chemistry
Journal title
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES
ISSN journal
00952338 → ACNP
Volume
39
Issue
3
Year of publication
1999
Pages
630 - 631
Database
ISI
SICI code
0095-2338(199905/06)39:3<630:IAPACL>2.0.ZU;2-9