View source for CMSC475 - Combinatorics and Graph Theory

'''Course Information''' <br>
General enumeration methods, difference equations, generating functions. Elements of graph theory, matrix representations of graphs, applications of graph theory to transport networks, matching theory and graphical algorithms.

{| style="text-align:left; width: 550PX;"
! Instructor
! Section
! Day & Time
! Location
|- style="vertical-align:top;" |
| Wiseley Wong || style="vertical-align:top;" | 0101 || MWF 10:00AM - 10:50AM || style="vertical-align:top;" | [http://maps.umd.edu/map/index.html?Welcome=False&MapView=Detailed&LocationType=Building&LocationName=084 MTH 0303]
|}

''' Course Prerequisite(s) ''' <br>
Prerequisite: MATH240 and MATH241; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program. Also offered as: MATH475.

''' Class Webpage ''' <br>


''' Hours Per Week ''' <br>


''' Languages Used ''' <br>
You will be taught LaTeX, and prior experience is not required.

''' Recommended Prior Experience ''' <br>
A STRONG proof background.

''' Projects, Exams, or other Assessments ''' <br>
All homework is to be typed up in LaTeX.

''' Misc Info ''' <br>
If you have NOT taken MATH 310 or CMSC 250, or are CURRENTLY taking either course, it is not recommended to take CMSC 475.