Listing, verifying and counting lowest common ancestors in DAGs: Algorithms and fine-grained lower bounds (Q6560892)
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: Listing, verifying and counting lowest common ancestors in DAGs: Algorithms and fine-grained lower bounds |
scientific article; zbMATH DE number 7870304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Listing, verifying and counting lowest common ancestors in DAGs: Algorithms and fine-grained lower bounds |
scientific article; zbMATH DE number 7870304 |
Statements
Listing, verifying and counting lowest common ancestors in DAGs: Algorithms and fine-grained lower bounds (English)
0 references
24 June 2024
0 references
all-pairs lowest common ancestor
0 references
fine-grained complexity
0 references
