Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

Efficient algorithms for finding Hamiltonian cycles, Hamiltonian paths, and cycles through two given vertices in bipartite tournaments are given.