On approximating the \(d\)-girth of a graph (Q2444552)
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: On approximating the d-girth of a graph |
scientific article; zbMATH DE number 6282274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating the \(d\)-girth of a graph |
scientific article; zbMATH DE number 6282274 |
Statements
On approximating the \(d\)-girth of a graph (English)
0 references
10 April 2014
0 references
generalized girth
0 references
minimum degree
0 references
approximation algorithm
0 references
hardness of approximation
0 references
randomized algorithm
0 references
planar graph
0 references
0 references
0.993386447429657
0 references
0.7374230027198792
0 references
