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

From MaRDI portal
Revision as of 07:55, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q221664)
scientific article
Language Label Description Also known as
English
Complexity of Finding Embeddings in a <i>k</i>-Tree
scientific article

    Statements

    title
    Complexity of Finding Embeddings in a <i>k</i>-Tree (English)
    0 references
    DOI
    10.1137/0608024
    0 references
    author
    Stefan Arnborg
    0 references
    Andrzej Proskurowski
    0 references
    publication date
    1987
    0 references
    Mathematics Subject Classification ID
    05C10
    0 references
    68Q25
    0 references
    90C39
    0 references
    zbMATH DE Number
    3987300
    0 references
    zbMATH Keywords
    algorithm complexity
    0 references
    NP completeness
    0 references
    k-tree
    0 references
    Wikidata QID
    Q29013861
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3751595&oldid=20584128"
    Powered by MediaWiki