ALGORITHMIC GRAPH THEORY
| Title | ΘΕΩΡΙΑ ΚΑΙ ΑΛΓΟΡΙΘΜΟΙ ΓΡΑΦΩΝ / ALGORITHMIC GRAPH THEORY |
| Code | NIS-06-06 |
| Faculty | Sciences |
| School | Informatics |
| Cycle / Level | 1st / Undergraduate |
| Teaching Period | Spring |
| Coordinator | John Paparrizos |
| Common | No |
| Status | Active |
| Course ID | 40002964 |
Programme of Study: PPS-Tmīma Plīroforikīs (2019-sīmera)
Registered students: 6
| Orientation | Attendance Type | Semester | Year | ECTS |
|---|---|---|---|---|
| GENIKĪ KATEUTHYNSĪ | YPOCΗREŌTIKO KATA EPILOGĪ | 6 | 3 | 5 |
| Academic Year | 2013 – 2014 |
| Class Period | Spring |
| Faculty Instructors |
|
| Weekly Hours | 4 |
| Class ID | 40049978
|
Course Type 2016-2020
- Background
Course Type 2011-2015
General Foundation
Mode of Delivery
- Face to face
Digital Course Content
- e-Study Guide https://qa.auth.gr/en/class/1/40049978
- At the Website of the School: http://delab.csd.auth.gr/~manolopo/graph/index2014.html
Erasmus
The course is also offered to exchange programme students.
Language of Instruction
- Greek (Instruction, Examination)
Prerequisites
General Prerequisites
There are no prerequisite course in the formal sense. It is necessary for the student to master Programming, Data Structres and Algorithms
General Competences
- Apply knowledge in practice
- Retrieve, analyse and synthesise data and information, with the use of necessary technologies
- Work autonomously
Course Content (Syllabus)
Introduction. Paths and cycles. Trees, Spanning trees. Conectivity. Planarity. Coloring. Directed graphs. Flows and Networks. Matching and covers.
Keywords
Paths. Cycles. Trees. Conectivity. Planarity. Coloring. Directed graphs. Flows and Networks. Matching and covers.
Educational Material Types
- Slide presentations
- Book
Use of Information and Communication Technologies
Use of ICT
- Use of ICT in Course Teaching
Course Organization
| Activities | Workload | ECTS | Individual | Teamwork | Erasmus |
|---|---|---|---|---|---|
| Lectures | ✓ | ||||
| Tutorial | ✓ | ||||
| Total |
Student Assessment
Description
Written exams, and projects. The exact procedure and weightning is announced on the course's website.
Student Assessment methods
- Written Exam with Short Answer Questions (Formative, Summative)
- Written Assignment (Formative)
- Written Exam with Problem Solving (Formative, Summative)
Bibliography
Course Bibliography (Eudoxus)
Ιωάννης Μανωλόπουλος: "Μαθήματα Θεωρίας Γράφων: Θεμελιώσεις-Αλγόριθμοι-Εφαρμογές", Εκδόσεις Νέων Τεχνολογιών, Αθήνα, 1996.
Additional bibliography for study
J. Gross and J. Yellen: "Graph Theory and its Applications", 2nd edition, CRC Press, 2006.
J. Gross and J. Yellen: "Handbook of Graph Theory", CRC Press, 2003.
Last Update
19-10-2015
