Reading suggestions for getting basic familiarity with algorithms [Oded].


To get basic familiarity with algorithms,
I suggest the following extracts from Even's book on Graph Algorithms.
* Sections 1.1-1.3: The mindframe + one algorithm (for "Eulerian").
* Section 1.5: Shortest Path algorithms.
[I guess you can stop here for familiarity,
but it may be good to cover also the next two items]
* Sec 2.1-2.2: Trees and finding a Min Spanning Tree.
* Sec 3.1 DFS (Sec 3.2 is of much lower priority, but I like it).
[The following is far less important for you]
* Sec 5.1 a simple max flow algorithm.
* Sec 6.4 application of max flow to Max Matching in Bipartite graphs.