Conditionally optimal approximation algorithms for the girth of a directed graph (Q6842541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8173939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditionally optimal approximation algorithms for the girth of a directed graph |
scientific article; zbMATH DE number 8173939 |
Statements
Conditionally optimal approximation algorithms for the girth of a directed graph (English)
0 references
18 March 2026
0 references
shortest cycle
0 references
girth
0 references
graph algorithms
0 references
approximation algorithms
0 references
fine-grained complexity
0 references
roundtrip spanner
0 references
0 references
0 references
