Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595)

From MaRDI portal
Revision as of 08:56, 9 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29013861, #quickstatements; #temporary_batch_1704785786528)
scientific article
Language Label Description Also known as
English
Complexity of Finding Embeddings in a <i>k</i>-Tree
scientific article

    Statements

    Complexity of Finding Embeddings in a <i>k</i>-Tree (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    algorithm complexity
    0 references
    NP completeness
    0 references
    k-tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references