Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1808492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the Longest Cycle Problem in Sparse Graphs |
scientific article; zbMATH DE number 1808492 |
Statements
Approximating the Longest Cycle Problem in Sparse Graphs (English)
0 references
29 September 2002
0 references
long paths and cycles
0 references
Hamiltonian graphs
0 references
approximation algorithms
0 references
0 references
0.9316544
0 references
0 references
0.9262957
0 references
0.91802335
0 references
0.91802335
0 references
0.91513216
0 references
0.9104471
0 references
0 references
