A remark on the time complexity of the subtree problem (Q1249180)

From MaRDI portal
Revision as of 09:25, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A remark on the time complexity of the subtree problem
scientific article

    Statements

    title
    A remark on the time complexity of the subtree problem (English)
    0 references
    DOI
    10.1007/BF02252027
    0 references
    author
    Manfred Stadel
    0 references
    published in
    Computing
    0 references
    publication date
    1978
    0 references
    Mathematics Subject Classification ID
    05C05
    0 references
    05-04
    0 references
    68Q25
    0 references
    zbMATH DE Number
    3598503
    0 references
    OpenAlex ID
    W1986116426
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1249180&oldid=36875218"
    Powered by MediaWiki