620-352 Graph Theory

Credit Points

12.5

HECS Band

2

Coordinator

Dr A Owczarek

Prerequisites

Twenty-five points from the following: 200-level science mathematics subjects, 200-level science statistics subjects, and computer science 433-253.

Semester

1 (view timetable)

Contact

36 lectures (three per week) and up to 12 practice classes (one per week)

Subject Description

This subject introduces the basic concepts of graph theory including paths and cycles, trees and counting, automorphism groups, planar graphs, colouring properties, chromatic polynomials and matching theory. Students should develop the ability to implement algorithms on graphs for finding objects such as minimum spanning trees, maximum matchings and flows; and to implement approximation algorithms. This subject demonstrates the variety of applications of graph theory within and outside mathematics.

Introduction to graph theory topics include basic concepts, paths and cycles, trees and counting, combinatorics, matching theory and probabilistic method. Algorithms topics include minimum spanning trees, maximum matchings, flows and approximation algorithm.

Assessment

Up to 24 pages of written assignments and a 3-hour end-of-semester written examination.



Status:                   Official 2004
Last Modified:            Monday June 21 22:12
SGML to HTML Conversion:  Information Division - CWIS (SDI)
Authorised by:            Academic Registrar
Enquiries:                http://unimelb.custhelp.com/

Valid CSS! Valid XHTML 1.0!