A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259)
From MaRDI portal
scientific article; zbMATH DE number 7758425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lower Bound on Cycle-Finding in Sparse Digraphs |
scientific article; zbMATH DE number 7758425 |
Statements
A Lower Bound on Cycle-Finding in Sparse Digraphs (English)
0 references
31 October 2023
0 references
property testing
0 references
directed acyclic graphs
0 references
randomized algorithms
0 references
graph algorithms
0 references
