CoChat

Some NP-Complete Problems Similar to Graph Isomorphism

Lubiw, Anna · 1981 · SIAM Journal on Computing

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Abstract

The GRAPH ISOMORPHISM problem has so far resisted attempts at determining its complexity status—it has not been shown to be NP-complete nor in P. In this paper several altered or generalized versions of the ISOMORPHISM problem are presented and shown to be NP-complete. One of these is the problem of determining whether a given graph has a fixed-point-free automorphism. Some speculation is made on the possible implications of these results on deciding the complexity status of ISOMORPHISM. Various classes and hierarchies of problems in NP are discussed.

Overview

Integrity signals

Registry

Crossref · 10.1137/0210002

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 7 references

Research works printed but not linked: 7

  1. L. Babai, On the isomorphism problem, Proc. FCT Conf., Poznań -Kórnik, 1977
  2. D. G. Corneil, Recent results on the graph isomorphism problem, Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1978), Congress. Numer., XXII, Utilitas Math., Winnipeg, Man., 1979, 13–31 81i:051130404.68054
  3. Garey Michael R., 1979, Computers and intractability
  4. Gorenstein P., 1968, Finite groups
  5. J. E. Hopcroft, J. K. Wong, Linear time algorithm for isomorphism of planar graphs: preliminary report, Sixth Annual ACM Symposium on Theory of Computing (Seattle, Wash., 1974), Assoc. Comput. Mach., New York, 1974, 172–184 55:69340369.05028 · DOI · Paper page
  6. Levi G., 1972, Calcolo, 9
  7. G. L. Miller, On the n**logn isomorphism technique, Proc. Tenth SIGACT Symp. on the Theory of Computing, 1978, 51–58, also Tech. Report 17, Univ. Rochester, 1976 · doi:10.1145/800133.804331

Cited by

Metadata

Authors
Lubiw, A.
Corresponding author
Lubiw, Anna
Venue
SIAM Journal on Computing
Published
1981-02
Volume
10
Issue
1
Pages
11-21
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2041176939
Cited by
144
References
7
Citations by year
2026: 2 · 2025: 3 · 2024: 1 · 2023: 4 · 2022: 5 · 2021: 3 · 2020: 4 · 2019: 5 · 2018: 6 · 2017: 5 · 2016: 12 · 2015: 6 · 2014: 7 · 2013: 6 · 2012: 4
FWCI
2.33
Type
journal article
Language
en
Open access
closed
Locations
SIAM Journal on Computing (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
Keywords
graph isomorphism, NP-completeness, fixed-point-free automorphisms, complexity classes, computational complexity

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.