A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916)
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 the Hamiltonian cycle problem in semicomplete multipartite digraphs |
scientific article; zbMATH DE number 1286470
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs |
scientific article; zbMATH DE number 1286470 |
Statements
7 July 1999
0 references
Hamiltonian cycle
0 references
polynomial algorithm
0 references
semicomplete multipartite digraphs
0 references
multipartite tournaments
0 references
cycle through specified vertices
0 references
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (English)
0 references
0.9527201
0 references
0.93482345
0 references
0.91296923
0 references
0.90586513
0 references
0.89744705
0 references
0.8963632
0 references
0.8956145
0 references
