2015-2016 University Catalog
Three semester hours.
This course discusses discrete mathematical structures, especially the enumeration and the optimization problems related to them. Algorithmic (constructive) aspects will be emphasized. Course work involves computer programming projects. Topics include: basic tools of combinatorics, graphs and networks, relations, the counting problems, the existence problems, the combinatorial optimization. Prerequisites: Graduate standing and permission of instructor.
Home - General Information - Student Services -
Academic Undergraduate Regulations -
Undergraduate Degrees - Academic Graduate Regulations -
Graduate Degrees - Course Descriptions - Faculty -
Appendix A - Appendix B - Appendix C - Appendix D