On Approximating the d-Girth of a Graph (Q3075539): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Approximating the d-Girth of a Graph |
scientific article |
Statements
On Approximating the d-Girth of a Graph (English)
0 references
15 February 2011
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
