Department of Computer Science & Engineering

University of Ioannina

Algorithmic Graph Theory

Course Feature
Class Description

Course ID: A1

Unit: DATA SCIENCE AND ENGINEERING – Unit A: Algorithms and Information Technologies

Weekly Hours: 4


ECTS Credits: 7

Course Homepage:


  • Graph theoretic foundations.
  • The design of efficient algorithms (complexity of algorithms, data structures). Perfect graphs. Holes and antiholes in graphs. Triangulated graphs.
  • Comparability graphs. Split graphs. Permutation graphs. Interval graphs. Cographs, Quasi-threshold (or, trivially perfect), and threshold graphs.
  • Perfectly orderable graphs.