and cycles in graphs which do not presently have efficient
solutions other than the brute-force method. For some of these,
some fast algorithms have been proposed recently. The purpose
of this course is to present an overview of these problems, some
recent algorithms and also their complexity status. The problems
we will be looking at are :
(1) Find paths and cycles of small length in a given graph or
digraph.
(2) Find long paths in a given graph/digraph.
(3) Find approximations to shortest paths in weighted graphs.