The isomorphism problem for \(k\)-trees is complete for logspace (Q714733)
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: The isomorphism problem for k-trees is complete for logspace |
scientific article; zbMATH DE number 6092977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The isomorphism problem for \(k\)-trees is complete for logspace |
scientific article; zbMATH DE number 6092977 |
Statements
The isomorphism problem for \(k\)-trees is complete for logspace (English)
0 references
11 October 2012
0 references
graph isomorphism
0 references
graph canonization
0 references
\(k\)-trees
0 references
space complexity
0 references
logspace completeness
0 references
0.9745684266090392
0 references
0.8939776420593262
0 references
0.8370697498321533
0 references
0.8313851356506348
0 references
0.8220481276512146
0 references
