Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of computing a partial solution for the graph automorphism problems |
scientific article; zbMATH DE number 5558989
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of computing a partial solution for the graph automorphism problems |
scientific article; zbMATH DE number 5558989 |
Statements
Computational complexity of computing a partial solution for the graph automorphism problems (English)
0 references
28 May 2009
0 references
computational complexity
0 references
reducibility
0 references
graph automorphism
0 references
partial solution
0 references
