Fast Algorithms for Finding Nearest Common Ancestors (Q3319776)

From MaRDI portal
Revision as of 18:20, 3 September 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
Fast Algorithms for Finding Nearest Common Ancestors
scientific article

    Statements

    Fast Algorithms for Finding Nearest Common Ancestors (English)
    0 references
    0 references
    0 references
    1984
    0 references
    graph algorithm
    0 references
    nearest common ancestor
    0 references
    tree
    0 references
    inverse Ackermann's function
    0 references
    random access machine
    0 references
    pointer machines
    0 references

    Identifiers

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