Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Introduces discrete structures applications of graph theory to computer science, engineering and operations research. Topics include connectivity, coloring, trees, Euler and Hamiltonian paths and circuits. Matching and covering problems, shortest route and network flows
Units: 3.0
Hours: 3 to 3