Handbook 1996 : Faculty of Science (Volume 4 page 214)
Mathematics subject : Next:618-360 | Prev:618-342 | Search | Help
618-352 "Graph Theory" appears differently in several places - choose the one you want:
1. Mathematics, Faculty of Science (v4, p214) : Next:618-360 | Prev:618-342
Credit points: 15.0
Coordinator: Dr A Byrne.
Prerequisite: Either 618-101 and 618-102 (1995 Handbook), or 618-111 and 618-112, or 618-121 and 618-122, or 618-200, or 618-100 and 618-101 (1995 Handbook), or 618-141 and 618-142. Alternatively, Mathematics 618-290 (Institute of Education).
Contact: 39 lectures (three a week)
Timetable: Second semester.
Objectives:
On completion of this subject, students should:Comprehend:
- the basic concepts of graph theory including paths and cycles, trees and counting, automorphism groups, planar graphs, colouring properties, chromatic polynomials, matching theory, cycle space.
Have developed:
- skills in implementing algorithms on graphs for finding objects such as minimum spanning trees, maximum matchings and flows;
- skills at implementing approximation algorithms.
Appreciate:
- the variety of applications of graph theory both within and outside mathematics.
Content:
Introduction to Graph Theory: basic concepts, paths and cycles, trees and counting, automorphism groups; planar graphs, colouring properties, chromatic polynomials, matching theory, cycle space. Algorithms:minimum spanning trees, maximum matchings, flows, approximation algorithm.
Assessment:
Up to 26 pages of written assignments and up to three hours of end-of-semester written examination.
1. Mathematics, Faculty of Science (v4, p214) : Next:618-360 | Prev:618-342
2. Math. & Stats., Faculty of Educ(Parkville) (v5, p149) : Next:618-360 | Prev:618-342
Credit points: 15.0
Coordinator: Dr A Byrne.
Prerequisite: Either 618-101 and 618-102 (1995 Handbook), or 618-111 and 618-112, or 618-121 and 618-122, or 618-200, or 618-100 and 618-101 (1995 Handbook), or 618-141 and 618-142. Alternatively, Mathematics 618-290 (Institute of Education).
Contact: 39 lectures (three each week)
Timetable: Second semester.
Objectives:
On completion of this subject, students should:Comprehend:
- the basic concepts of graph theory including paths and cycles, trees and counting, automorphism groups, planar graphs, colouring properties, chromatic polynomials, matching theory, cycle space.
Have developed:
- skills in implementing algorithms on graphs for finding objects such as minimum spanning trees, maximum matchings and flows;
- skills at implementing approximation algorithms.
Appreciate:
- the variety of applications of graph theory both within and outside mathematics.
Content:
Introduction to Graph Theory Basic concepts, paths and cycles, trees and counting, automorphism groups; planar graphs, colouring properties, chromatic polynomials, matching theory, cycle space. Algorithms Minimum spanning trees, maximum matchings, flows, approximation algorithm.
Assessment:
Up to 26 pages of written assignments and up to three hours of end-of-semester written examination.
* Note that CONTACT, CONTENT differs from the maintainer's version above. A log of variations is available.
2. Math. & Stats., Faculty of Educ(Parkville) (v5, p149) : Next:618-360 | Prev:618-342
Status: Official 1996 Date created: Oct 9 1995 Last modified: Oct 9 1995 Authorised by: Academic Registrar Email enquiries: Course_Information@registrar.unimelb.edu.au
Maintained by: Dept. of Mathematics, Faculty of Science.
Copyright © University of Melbourne 1995,1996.