The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Practical graph isomorphism, II
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · doi:10.1109/sfcs.1994 · Cited by 1,087
Isomorphism of graphs of bounded valence can be tested in polynomial time
Luks, E. M. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90009-5 · Cited by 645
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
(2023) · doi:10.1145/3564246 · Cited by 587
Read, R. C., & Corneil, D. G. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010410 · Cited by 453
An Efficient Algorithm for Graph Isomorphism
Corneil, D. G., & Gotlieb, C. C. (1970) · Journal of the ACM · doi:10.1145/321556.321562 · Cited by 334
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
Junttila, T., & Kaski, P. (2007) · 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972870.13 · Cited by 247
Exploiting structure in symmetry detection for CNF
Darga, P. T., Liffiton, M. H., Sakallah, K. A., & Markov, I. L. (2004) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/996566.996712 · Cited by 172
Isomorphism testing for graphs of bounded genus
Miller, G. L. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804670 · Cited by 148
Computational complexity and the classification of finite simple groups
Babai, L., Kantor, W. M., & Luks, E. M. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.10 · Cited by 123
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
Filotti, I. S., & Mayer, J. N. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804671 · Cited by 110
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
Colbourn, C. J., & Booth, K. S. (1981) · SIAM Journal on Computing · doi:10.1137/0210015 · Cited by 81
Computing automorphisms and canonical labellings of graphs
McKay, B. D. (1978) · Lecture notes in mathematics · doi:10.1007/bfb0062536 · Cited by 47
Self-citationGraph and map isomorphism and all polyhedral embeddings in linear time
Kawarabayashi, K., & Mohar, B. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374443 · Cited by 41
Structural and logical approaches to the graph isomorphism problem
Grohe, M. (2012) · Symposium on Discrete Algorithms · doi:10.5555/2095116.2095132 · Cited by 5
Cited by
Open Babel: An open chemical toolbox
O'Boyle, N. M., Banck, M., James, C. A., Morley, C., Vandermeersch, T., & Hutchison, G. R. (2011) · Journal of Cheminformatics · doi:10.1186/1758-2946-3-33 · Cited by 10,939
Deep Learning on Graphs: A Survey
Zhang, Z., Cui, P., & Zhu, W. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2981333 · Cited by 1,633
Enumeration of 166 Billion Organic Small Molecules in the Chemical Universe Database GDB-17
Ruddigkeit, L., van Deursen, R., Blum, L. C., & Reymond, J.-L. (2012) · Journal of Chemical Information and Modeling · doi:10.1021/ci300415d · Cited by 1,505
An End-to-End Deep Learning Architecture for Graph Classification
Zhang, M., Cui, Z., Neumann, M., & Chen, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11782 · Cited by 1,461
InChI, the IUPAC International Chemical Identifier
Heller, S. R., McNaught, A., Pletnev, I., Stein, S., & Tchekhovskoi, D. (2015) · Journal of Cheminformatics · doi:10.1186/s13321-015-0068-4 · Cited by 867
Metadata
- Authors
- McKay, B. D., & Piperno, A.
- Venue
- Journal of Symbolic Computation
- Publisher
- Elsevier BV
- Published
- 2014-01
- Volume
- 60
- Pages
- 94-112
- ISSN
- 0747-7171 (ISSN-L)
- OpenAlex
- W1990600049
- Cited by
- 1,597
- References
- 16
- FWCI
- 134.19
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.