The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953)

From MaRDI portal
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
    16 October 2009
    0 references
    graph isomorphism
    0 references
    graph canonization
    0 references
    \(k\)-trees
    0 references
    space complexity
    0 references
    logspace completeness
    0 references

    Identifiers