Table of Contents
Course Information: Syllabus, Assignments, Project, Due Dates, etc
|
| Course Syllabus & Assignment List for the Course
|
|
Math 3411 Syllabus |
Math 3411 Hw page. (This is where you will find the updated
hw list and due dates.) |
|
|
|
| Upcoming Due Dates for Assignments or Project, & Upcoming Exam Dates |
Exam 3 : Tue Nov 24; the
exam covers Section 5, 6, and 7 - i.e. HW #15, 16, 17, 18.
Review for Exam 3 |
Hw due December 1: Problems from
Shortest Paths |
Hw due Thur December 3: Problems from
Maximum s-t Flow |
Course Project's
report is due by 10am in my office on Dec 4, 2009.
Copies of the
report's
evaluation and
presentation's evaluation.
|
|
| Course Handouts and Other Pertinent Course Stuff |
|
Handout on
Rationale behind Ford-Fulkerson's algorithm.
For class on Dec 1. |
Ford-Fulkerson's
Algorithm for Solving Maximum s-t Flow Problem .
For class on Dec 1. |
Handout on
Rationale behind Dijkstra's and Floyd-Warshall's algorithms.
For class on Nov 17-19. |
Handout 9:
Shortest Di-Path Methods - Dijkstra and Floyd-Warshall .
For class on Nov 17-19. |
Handout 8:
Constructing Euler Tours in Eulerian Graphs .
For class on Nov 12. |
|
Handout 7:
Greedy or Kruskal's Algorithm for solving MCST .
For class on Nov 12. |
Handout 6;
applications of MCST .
For class on Nov 12. |
Handout 5;
Fundamentals of Graph Theory.
For class on Nov 5 - 10. |
Handout 4;
more examples on Counting Process and your HW.
For class on Oct 27 and Nov 3, and 5. |
Handout 3;
examples for Counting Process.
For class on Oct 27 and Nov 3. |
|
applications of discrete dynamical systems .
For class on Oct 22. |
Example of Solving Recurrence Relations on mathematica
For class on Oct 22.
(You need this for the hw due on numerical approaches to discrete dynamical systems.) |
Handout 2.
For class on Oct 6-8. |
Handout 1.
For class on Sep 8-10. |
|
|
|
|
|
|
|
|
|
|
|
Resources on Discrete & Combinatorial Mathematics
|
| The Discrete Mathematics Project |
DIMACS, Center for Discrete Mathematics and Theoretical Computer Science |
Network Resource for Operations Research |
Games on Graph Theory |
Mathematics Archives on Discrete Mathematics |
GIDEN's Headquarters at Northwestern University |
GIDEN (Graphical Implementation Development Environment for Networks) (software for solving optimization problems on graphs). |
|
|
|
Resources on Open Problems
(And who says mathematics is not fun? )
|
| A few open problems in Graph Theory and Combinatorics |
A few open problems in
Topological Graph Theory |
|
|
|
