Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for finding lowest common ancestors in directed acyclic graphs |
scientific article |
Statements
Faster algorithms for finding lowest common ancestors in directed acyclic graphs (English)
0 references
16 July 2007
0 references
directed acyclic graphs
0 references
lowest common ancestors
0 references
matrix multiplication
0 references
time complexity
0 references
0 references
