UBC-MATH 442: Optimization in Graphs and Networks Collection home page

Basic graph theory, emphasizing trees, tree growing algorithms, and proof techniques. Problems chosen from: shortest paths, maximum flows, minimum cost flows, matchings, graph colouring. Linear programming duality will be an important tool.

Please review the license information provided for each item as usage rights vary.