On approximating the longest path in a graph (Q679451)
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 1002568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating the longest path in a graph |
scientific article; zbMATH DE number 1002568 |
Statements
On approximating the longest path in a graph (English)
0 references
12 November 1997
0 references
undirected graphs
0 references
greedy algorithm
0 references
0.97659236
0 references
0.94171983
0 references
0 references
0 references
0.9284609
0 references
0.9232365
0 references
0 references
0.92091006
0 references
