Fast Algorithms for Finding Nearest Common Ancestors (Q3319776): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29029956 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011999472 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:05, 20 March 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
