Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804)
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: Efficient approximation algorithms for shortest cycles in undirected graphs |
scientific article; zbMATH DE number 5771247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient approximation algorithms for shortest cycles in undirected graphs |
scientific article; zbMATH DE number 5771247 |
Statements
Efficient approximation algorithms for shortest cycles in undirected graphs (English)
0 references
16 August 2010
0 references
graph algorithm
0 references
approximation algorithm
0 references
shortest cycle
0 references
undirected graph
0 references
time complexity
0 references
0 references
0.9912959337234496
0 references
0.871159017086029
0 references
0.8647366166114807
0 references
0.8544190526008606
0 references
0.8520237803459167
0 references
