Fall 1998 - Yefim
Dinitz - Teaching
Advanced Topics in Graph Algorithms and Structures
- Fall 98
201-24561
Hours:
Class:
-
Mon 12:00-14:00, Room 32-113
-
Wed 11:00-13:00, Room 34-009
Staff:
Instructor: Yefim Dinitz
email: dinitz@cs.bgu.ac.il
Tel: 7-867
Room: 303
Office Hours: Tue 10:10-11:40
Objectives
This course is a continuation of the basic course on Algorithms, specificaly,
on Graph Algorithms. Main emphasis is done on Network Flows, Minimum cuts
and Connectivity. Besides, the following topics are concerned :
-
amortized analysis of the algorithm complexity;
-
maintenance of a structure under graph changes;
-
listing of all graph objects of a certain type (cuts , paths ...)
-
aproximation algorithms
Info:
On-line papers:
Homeworks:
Relevant literature :
-
Corman, Leiserson, Rivest. Introduction to Algorithms [CLR].
-
S. Even. Graph Algorithms [E].
-
Ahuja, Magnetti, Orlin. Network Flow Algorithms [AMO].
-
papers
Last modified March 15, 1999 Yefim
Dinitz