Fast Algorithms for Finding Nearest Common Ancestors (Q3319776)

From MaRDI portal
Revision as of 11:06, 28 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29029956, #quickstatements; #temporary_batch_1706398787052)
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
    0 references