Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057674369 / rank | |||
Normal rank | |||
Revision as of 01:40, 20 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
