On Approximating the d-Girth of a Graph (Q3075539): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_39 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1548537566 / rank | |||
Normal rank | |||
Revision as of 23:09, 19 March 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
