Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575)
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 5263953
| 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 5263953 |
Statements
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (English)
0 references
15 April 2008
0 references
0 references
0.9912959337234496
0 references
0.8741869330406189
0 references
0.8663418292999268
0 references
0.8624734282493591
0 references
0.8614029884338379
0 references
