𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

✍ Scribed by Bang-Jensen, J�rgen; Gutin, Gregory; Yeo, Anders


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
382 KB
Volume
29
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G.