MATH231-10S2 (C)
Discrete Methods
This is a second semester course worth 11 points.
Course Information
Many real-world problems can be interpreted and solved in terms of graphs (networks). These problems arise in diverse areas including operations research and evolutionary biology. Very often, such problems require an algorithmic solution. This course is an introduction to graph theory. One of its objectives is to show how results in graph theory lead to such solutions.
Topics
Digraphs (directed graphs), critical path analysis, rooted trees. Graphs, connectedness, trees, planarity. Shortest paths, greedy algorithms, travelling salesman problem.
Class Representative
Text
A course reader will be available.
Enquiries
Dr David Robinson
Room 604 Erskine Building
Phone Extension 8384