The isomorphism problem for \(k\)-trees is complete for logspace (Q714733): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 10:59, 30 January 2024

scientific article
Language Label Description Also known as
English
The isomorphism problem for \(k\)-trees is complete for logspace
scientific article

    Statements

    The isomorphism problem for \(k\)-trees is complete for logspace (English)
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references