A successful algorithm for solving directed Hamiltonian path problems (Q788642)
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: A successful algorithm for solving directed Hamiltonian path problems |
scientific article; zbMATH DE number 3843522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A successful algorithm for solving directed Hamiltonian path problems |
scientific article; zbMATH DE number 3843522 |
Statements
A successful algorithm for solving directed Hamiltonian path problems (English)
0 references
1984
0 references
ramification index
0 references
graph-theoretic polynomial algorithm
0 references
Hamiltonian path
0 references
spanning arborescences
0 references
Computational experience
0 references
0.97247684
0 references
0.89299905
0 references
0.8879087
0 references
0.87171984
0 references
0.8707985
0 references
0.86734164
0 references
