Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539701395486 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028363565 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Longest Cycle Problem in Sparse Graphs |
scientific article |
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
