COMP 150-ALG: Topics on Algorithms, Graphs and Data Structures
(Summer 2017)

Projects

In arbitrary order:
  1. Jamie H
    A description of the Edmonds-Karp algorithm, and an interactive demo that shows the algorithm's steps on arbitrary user input.
  2. Catherine K
    A description of the proof that triangle-free planar graphs can be 3-colored.
  3. Nate B. (part 2)
    Implementation of Megiddo's 2d LP algorithm, plus development of (and experimentation on a) "strongly-typed, monomorphic, functional language based on lists and naturals with a resource-aware type system capable of reporting upper bounds for functions and expressions that are linear in their inputs, along with an accompanying interpreter."
  4. Garrett D
    A description of the blossom algorithm, which produces a maximum matching.