Campus Event Calendar
Event Entry
What and Who
Finding paths and cycles in graphs.
C.R. Subramanian
Max-Planck Institute fur Informatik, Saarbrucken
AG1 Advanced Mini-Course
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 10 November 98
13:30
90 minutes.
46
024
Saarbrücken
Abstract
There are several interesting problems related to finding paths
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.
Contact
C. R. Subramanian
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Graph algorithms.