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

From MaRDI portal
Revision as of 20:01, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm complexity
    0 references
    NP completeness
    0 references
    k-tree
    0 references