Graph theory, emphasizing trees, tree growing algorithms, and proof techniques. Other topics chosen from shortest paths, maximum flows, minimum cost flows, matchings, and graph colouring. [3-0-0] Prerequisite: 3rd year standing and one of MATH 220, MATH 223, MATH 226 or CPSC 221.
Graph theory, emphasizing trees, tree growing algorithms, and proof techniques. Other topics chosen from shortest paths, maximum flows, minimum cost flows, matchings, and graph colouring. [3-0-0] Prerequisite: 3rd year standing and one of MATH 220, MATH 223, MATH 226 or CPSC 221.
