Algorithmic Graph Theory (ΠΛ4): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
Χωρίς σύνοψη επεξεργασίας |
Χωρίς σύνοψη επεξεργασίας |
||
Γραμμή 1: | Γραμμή 1: | ||
* [[ | * [[Αλγοριθμική Θεωρία Γραφημάτων (ΠΛ4)|Ελληνική Έκδοση]] | ||
* [[Graduate Courses Outlines]] | * [[Graduate Courses Outlines]] | ||
* [https://math.uoi.gr/index.php/en/ Department of Mathematics] | * [https://math.uoi.gr/index.php/en/ Department of Mathematics] |
Αναθεώρηση της 17:47, 25 Νοεμβρίου 2022
General
School | School of Science |
---|---|
Academic Unit | Department of Mathematics |
Level of Studies | Graduate |
Course Code | ΠΛ4 |
Semester | 2 |
Course Title | Algorithmic Graph Theory |
Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 7.5) |
Course Type | Special Background |
Prerequisite Courses | - |
Language of Instruction and Examinations | Greek |
Is the Course Offered to Erasmus Students | Yes (in English) |
Course Website (URL) | See eCourse, the Learning Management System maintained by the University of Ioannina. |
Learning Outcomes
Learning outcomes | This course aims at introducing to students fundamental algorithmic techniques for solving problems related and modeled by graphs. After successfully passing this course the students will be able to:
|
---|---|
General Competences |
All the above will give to the stundetns the opportunity to work in an international multidisciplinary environment. |
Syllabus
- Fundamental Graph Theory
- Algorithmic and Combinatorial Graph Problems
- Complexity Classes and Parameterized Algorithms
- Chordal graphs, Comparability graphs, Split graphs
- Permutation graphs, Interval graphs, Cographs, Threshold graphs
- Algorithmic problems and width parameters
Teaching and Learning Methods - Evaluation
Delivery | In the class | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Use of Information and Communications Technology | Use of projector and interactive board during lectures. | ||||||||||
Teaching Methods |
| ||||||||||
Student Performance Evaluation |
|
Attached Bibliography
- Cormen, Leiserson and Rivest, Introduction to Algorithms, MIT Press, 1990. (επίσης μεταφρασμένο από τις Πανεπιστημιακές Εκδόσεις Κρήτης)
- Δομές δεδομένων, αλγόριθμοι και εφαρμογές c++, Sahnii Sartaj, Εκδόσεις α. Τζιόλα
- Αλγόριθμοι σε C++, μέρη 1-4: θεμελιώδεις έννοιες, δομές δεδομένων, ταξινόμηση, αναζήτηση, Robert Sedgewick, Εκδόσεις Κλειδάριθμος
- Αλγοριθμοι σε C, μέρη 1-4: θεμελιώδεις έννοιες, δομές δεδομένων, ταξινόμηση, αναζήτηση, Robert Sedgewick, Εκδόσεις Κλειδάριθμος
- Mark Allen Weiss, Data Structures & Algorithm Analysis in Java, Addison-Wesley
- Clifford A. Shaffer, Data Structures and Algorithm Analysis, ebook, http://people.cs.vt.edu/shaffer/Book/
- A. Aho, J. Hopcroft, J. Ullman, (1983). Data Structures and Algorithms, Addison-Wesley.
- Baase, S., Computer Algorithms - Introduction to Design and Analysis, Second Edition, , Addison Wesley, Reading, Massachusetts, 1988.
- Knuth, D., The Art of Computer Programming - Vol. 1 Fundamental Algorithm, Addison Wesley, Reading, Massachusetts, 1973.
- Knuth, D., The Art of Computer Programming - Vol. 2 SemiNumerical Algorithm, Addison Wesley, Reading, Massachusetts, 1973.
- Knuth, D., The Art of Computer Programming - Vol. 3 Sorting and Searching, Addison Wesley, Reading, Massachusetts, 1973.