Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests (Q882106)
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 5156483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests |
scientific article; zbMATH DE number 5156483 |
Statements
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests (English)
0 references
23 May 2007
0 references
Hamiltonian graphs
0 references
greedy algorithm
0 references
0.787821888923645
0 references
0.7234312295913696
0 references
0.722532331943512
0 references
0.7187894582748413
0 references
