On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs

We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed informations on the difference in difficulties for these problems for the various classes as well as prove new results on hamiltonian paths starting in a specified vertex for a quite general class of digraphs.

• Type: Journal
• Year: 1999
• Where: DAM
• Authors: Jørgen Bang-Jensen, Gregory Gutin
• Keywords: DAM 1999, Hamiltonian Paths, Parallel Complexity, Various Classes