An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883)
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: An approximation algorithm for finding long paths in Hamiltonian graphs |
scientific article; zbMATH DE number 2105335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for finding long paths in Hamiltonian graphs |
scientific article; zbMATH DE number 2105335 |
Statements
An approximation algorithm for finding long paths in Hamiltonian graphs (English)
0 references
1 October 2004
0 references
0.93254524
0 references
0.9232365
0 references
0.9186982
0 references
0.9154856
0 references
0.9145861
0 references
0.9133462
0 references
0.9109272
0 references
0.9065857
0 references
