Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of computing a partial solution for the graph automorphism problems |
scientific article |
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
