2 search results - page 1 / 1 » On the Complexity of Hamiltonian Path and Cycle Problems in ... |
DAM
1999
13 years 7 months ago
1999
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 in...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...