✦ LIBER ✦

A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph

✍ Scribed by Anders Yeo

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 181 KB
Volume: 33
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1999.1041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for the Hamiltoni

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

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Yeo, Anders 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

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