Document Actions
MATH322 (PC)
|
|
Networks & Graph Theory |
|
|
16 |
|
|
|
|
|
To explore proof techniques and algorithms and to acquire problem solving skills in discrete mathematics. |
|
|
Introductory concepts, isomorphic graphs, connectivity, shortest path algorithms, distance in graphs, trees and the minimum spanning tree problem, networks, maximum flow problems, Eulerian graphs and the Chinese postman problem, Hamiltonian graphs. Planar graphs and colouring problems. |
|
|
Class tests and/or assignments (33%), 3 h exam (67%). |
|
|
30% Class mark, 80% attendance at lectures & tutorials. |
|
|
in either Semester 1 or 2. |