Author/Authors :
J?rgen Bang-Jensen، نويسنده , , Gregory Gutin، نويسنده ,
Abstract :
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.
Keywords :
Path-mergeable digraph , Quasi-transitive digraph , In-semicomplete digraph , Decomposable digraph , Multipartite tournament , Semicomplete multipartite digraph , Longest path , Flows , Hamiltonian path , Path covering , Polynomial algorithm , Parallel algorithm , Hamiltonian cycle , Cycle factor , Path factor , Locally semicomplete digraphs , Hamiltonian connected
