Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Faster algorithms for finding lowest common ancestors in directed acyclic graphs |
scientific article; zbMATH DE number 5171352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for finding lowest common ancestors in directed acyclic graphs |
scientific article; zbMATH DE number 5171352 |
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
0.9465364
0 references
0 references
0.92843825
0 references
0.9087757
0 references
0.90729535
0 references
0.90247834
0 references
0.89358795
0 references
0.8877605
0 references
