A one-to-one correspondence between two classes of ordered trees (Q1123634)

From MaRDI portal
Revision as of 10:09, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A one-to-one correspondence between two classes of ordered trees
scientific article

    Statements

    title
    A one-to-one correspondence between two classes of ordered trees (English)
    0 references
    author
    Rainer Kemp
    0 references
    publication date
    1989
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q60
    0 references
    05C05
    0 references
    zbMATH DE Number
    4110141
    0 references
    zbMATH Keywords
    combinatorial problems
    0 references
    data structures
    0 references
    ordered trees
    0 references
    postorder- traversing
    0 references
    OpenAlex ID
    W2058211217
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1123634&oldid=34806911"
    Powered by MediaWiki