The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An optimal lower bound on the number of variables for graph identification
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The complexity of relational query languages (Extended Abstract)
Vardi, M. Y. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802186 · Cited by 1,184
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
Relational queries computable in polynomial time
Immerman, N. (1986) · Information and Control · doi:10.1016/s0019-9958(86)80029-8 · Cited by 643
Self-citationLanguages that Capture Complexity Classes
Immerman, N. (1987) · SIAM Journal on Computing · doi:10.1137/0216051 · Cited by 546
Self-citationStructure and complexity of relational queries
Chandra, A., & Harel, D. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90012-5 · Cited by 534
Read, R. C., & Corneil, D. G. (1977) · Journal of Graph Theory · doi:10.1002/jgt.3190010410 · Cited by 453
Babai, L., & Luks, E. M. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808746 · Cited by 410
Logic and the Challenge of Computer Science
Gurevich, Y. G. (1985) · Deep Blue (University of Michigan) · Cited by 321
Babai, L., Erdo˝s, P., & Selkow, S. M. (1980) · SIAM Journal on Computing · doi:10.1137/0209047 · Cited by 293
Upper and lower bounds for first order expressibility
Immerman, N. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90011-3 · Cited by 263
Self-citationA note on the graph isomorphism counting problem
Mathon, R. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90004-8 · Cited by 200
Number of quantifiers is better than number of tape cells
Immerman, N. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90039-8 · Cited by 174
Self-citationZemlyachenko, V. N., Korneenko, N. M., & Tyshkevich, R. I. (1985) · Journal of Mathematical Sciences · doi:10.1007/bf02104746 · Cited by 174
Canonical labelling of graphs in linear average time
Babai, L., & Kucera, L. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.8 · Cited by 158
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
Djoković, D. Ž. (1971) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(71)90050-5 · Cited by 23
Recursive construction for 3-regular expanders
Ajtai, M. (1987) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1987.50 · Cited by 13
Cited by
Shen, M., Zhang, J., Zhu, L., Xu, K., & Du, X. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3050608 · Cited by 392
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
How Powerful are Graph Neural Networks?
Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00826 · Cited by 332
On the Decision Problem for Two-Variable First-Order Logic
Grädel, E., Kolaitis, P. G., & Vardi, M. Y. (1997) · Bulletin of Symbolic Logic · doi:10.2307/421196 · Cited by 321
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
Metadata
- Authors
- Cai, J.-Y., F�rer, M., & Immerman, N.
- Venue
- Combinatorica
- Published
- 1992-12
- Volume
- 12
- Issue
- 4
- Pages
- 389-410
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2181072414
- Cited by
- 502
- References
- 18
- FWCI
- 6.51
- Type
- journal article
- Language
- en
- Open access
- closed
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.