A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs (Q3990618)
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 polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs |
scientific article; zbMATH DE number 38395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs |
scientific article; zbMATH DE number 38395 |
Statements
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs (English)
0 references
28 June 1992
0 references
polynomial algorithm
0 references
Hamiltonian path
0 references
