A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971)
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: A scalable approach to computing representative lowest common ancestor in directed acyclic graphs |
scientific article; zbMATH DE number 6244601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A scalable approach to computing representative lowest common ancestor in directed acyclic graphs |
scientific article; zbMATH DE number 6244601 |
Statements
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (English)
0 references
13 January 2014
0 references
lowest common ancestors
0 references
directed acyclic graph
0 references
0.92843825
0 references
0.9132923
0 references
0 references
0.89178574
0 references
0.8779978
0 references
0.8687043
0 references
0 references
0.85648227
0 references
