On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
J Bang-Jensen, G Gutin - Discrete applied mathematics, 1999 - Elsevier
Discrete applied mathematics, 1999•Elsevier
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.
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.
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.
Elsevier
Showing the best result for this search. See all results