Fast Algorithms for Finding Nearest Common Ancestors (Q3319776): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29029956, #quickstatements; #temporary_batch_1706398787052 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:56, 4 February 2024
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
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
