Construct · 1 fields · 1 citations

graph isomorphism problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
graph isomorphismproblem1 CONSTRUCTGraph isomorphismBABAI · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the problem of deciding whether two graphs are the same up to relabeling, not known to be in P nor NP-complete and solvable in quasipolynomial time.

In computational complexity, graph isomorphism problem refers to the problem of deciding whether two graphs are the same up to relabeling, not known to be in P nor NP-complete and solvable in quasipolynomial time. This meaning comes from Babai (2016) in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how graph isomorphism problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructsisomorphism4 fields · 4 citationsjingle · one word, sameness in four meanings

References

  1. Babai, L. (2016). Graph isomorphism in quasipolynomial time [extended abstract]. Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. https://doi.org/10.1145/2897518.2897542

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct