Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Introduces discrete structures and applications of graph theory to computer science, engineering, operations research, social science, and biology. Topics include connectivity, coloring, trees, Euler and Hamiltonian paths and circuits, matching and covering problems, shortest route and network flows. Note: This course assumes that students have taken MATH/CSCI 2511 or MATH 3000. Students who have a grade of B- or better in MATH/CSCI 2511 or MATH 3000 pass this course at a much higher rate. Cross-listed with CSCI 4408 and MCKE 5408. Term offered: spring.
Units: 3.0
Hours: 3 to 3