Some NP-Complete Problems Similar to Graph Isomorphism (Q3902476): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q55894627, #quickstatements; #temporary_batch_1711574657256 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0210002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041176939 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55894627 / rank | |||
Normal rank | |||
Latest revision as of 00:38, 28 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some NP-Complete Problems Similar to Graph Isomorphism |
scientific article |
Statements
Some NP-Complete Problems Similar to Graph Isomorphism (English)
0 references
1981
0 references
graph automorphism
0 references
