SIAM Journal on Discrete Mathematics · 1990 · 16 citations · 3 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationCombinatorial OptimizationComputational AlgebraComputational ComplexityGraph AlgorithmsAlgorithmic Graph TheoryHamiltonian CyclesHamiltonian GraphsHamiltonian Path AlgorithmsHamiltonian Path ProblemHamiltonian PathsPolynomial OptimizationPolynomial-time Algorithms
Efficient algorithms for finding Hamiltonian cycles, Hamiltonian paths, and cycles through two given vertices in bipartite tournaments are given.MSC codes68C2568E10Keywordspolynomial algorithmbipartite tournamentHamiltonian cycle
3