Information list for the course
		        201-24561
  Advanced Topics in Graph Algorithms and Structures
    (prerequisites: Algorithms, Data Structures)
		       1998/99-A

Lecturer:		Prof. Yefim Dinitz
Reception hours:	Tuesday 10.10 - 11.40, room 303, phone 8-623
			(any other time for urgent cases only)

Lectures:		Monday    12-14, room 32-113
			Wednesday 11-13, room 34-009

Final grade = (0.7*Exam + 0.25*Home Work + 0.2*Activity)


Exam:  extended home work given for 1.5-2 weeks during the exam period.
----
Home Work:
---------
#issues: 		6(+-1)  during the semester;
submission:		in single or in pair;
state:			obligatory;
general grade:		= average(all - the worst one);
late submission:	minus (20 + 10*#weeks + #days),
			0 for a problem already solved at a lecture; 
writing:		in Hebrew, English (or Russian?),
			electronic or clearly handwrited ("lo barur" 
			might be said for either proof or writing);
solution style:		complete & laconic (extra length might be fined).

Activity:  non-formalized. Includes activity on lectures, solution of
--------   		   course/home-work problems given in-advance,
			   valuable new ideas, etc.

File of the course will be maintained; available at Mazal.
------------------
For typing formulas:  s_i, s^i, >=, +-*/, =>, ->, Phi, Theta.
    ---------------
	One idea concerning figures, Greek letters etc.
	is to print the plain file with certain spaces 
	and to fill them by hand. Simpler way for figures
	is to give them on a separate page (named or numbered).

		* * * * *

  This course is a continuation of the basic course
on Algorithms, specifically, 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, ...);
 - approximation algorithms.

I believe very much that you will learn Algorithm Art,
to get ability to solve a problem in an effective and
beautiful way.

  Relevant literature is books "Introduction to Algorithms"
by Leiserson et al. [CLR], "Graph Algorithms" by Even [E],
"Network Flow Algorithms" by Ahuja et al. [AMO], and papers.