Tight conditional lower bounds for approximating diameter in directed graphs (Q6065286)
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: Tight conditional lower bounds for approximating diameter in directed graphs |
scientific article; zbMATH DE number 7765280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight conditional lower bounds for approximating diameter in directed graphs |
scientific article; zbMATH DE number 7765280 |
Statements
Tight conditional lower bounds for approximating diameter in directed graphs (English)
0 references
14 November 2023
0 references
fine-grained complexity
0 references
graph algorithms
0 references
graph diameter
0 references
