Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners (Q4607979)
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: Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners |
scientific article; zbMATH DE number 6850400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners |
scientific article; zbMATH DE number 6850400 |
Statements
15 March 2018
0 references
0.8407008647918701
0 references
0.8225820064544678
0 references
0.8133542537689209
0 references
0.8034906387329102
0 references
