A successful algorithm for solving directed Hamiltonian path problems (Q788642): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(84)90069-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039484262 / rank | |||
Normal rank | |||
Revision as of 02:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A successful algorithm for solving directed Hamiltonian path problems |
scientific article |
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
