The DOI matches its Crossref record.
Canonical labelling of graphs in linear average time
Abstract
Canonical labelling of graphs (CL, for short) can be used, e.g., to test isomorphism. We prove that a simple vertex classification procedure results after only two refinement steps in a CL of random graphs with probability 1 - exp(-cn). With a slight modification we obtain a linear time CL algorithm with only exp(-cn log n/log log n) probability of failure. An additional depth-first search yields a CL of all graphs in linear average time.
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
Cited by
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks
Morris, C., Ritzert, M., Fey, M., Hamilton, W. L., Lenssen, J. E., Rattan, G., & Grohe, M. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014602 · Cited by 1,210
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Hamilton, W. L. (2020) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01588-5 · Cited by 607
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
An optimal lower bound on the number of variables for graph identification
Cai, J.-Y., F�rer, M., & Immerman, N. (1992) · Combinatorica · doi:10.1007/bf01305232 · Cited by 502
Metadata
- Authors
- Babai, L., & Kucera, L.
- Venue
- 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- Publisher
- IEEE
- Published
- 1979-10
- Pages
- 39-46
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2017024025
- Cited by
- 158
- References
- 0
- FWCI
- 8.63
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Canonical labelling of graphs in linear average time. https://app.cochat.ai/papers/10.1109/sfcs.1979.8
- The paper
- Babai, L., & Kucera, L. (1979). Canonical labelling of graphs in linear average time. 20th Annual Symposium on Foundations of Computer Science (sfcs 1979). https://doi.org/10.1109/sfcs.1979.8
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.