Algorithmic trade-offs for girth approximation in undirected graphs (Q6575136)
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: Algorithmic trade-offs for girth approximation in undirected graphs |
scientific article; zbMATH DE number 7883643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic trade-offs for girth approximation in undirected graphs |
scientific article; zbMATH DE number 7883643 |
Statements
Algorithmic trade-offs for girth approximation in undirected graphs (English)
0 references
19 July 2024
0 references
