Algorithmic Graph Theory


The aim of this course is to familiarize the students with basic principles related to graph theory, e.g. definitions, theorems and algorithms. At first, basic definitions and operations related to graphs. The remainder of the course focuses on basic and advanced topics related to graph theory, specifically connectivity, planarity, color mapping and more.

Objectives

Introduction to graph theory. Understanding of graphs’ structure and basic theorems. Competence in specialized concepts like connectivity, planarity, color mapping, flow network and trees. Acquisition of skills related to techniques and algorithms of graph theory, like the algorithms for finding the minimum spanning tree.

Prerequisites

Basic knowledge and understanding of Algorithms

Syllabus

Introduction Paths and cycles Trees Connectivity Plananarity Color mapping Directed graphs Matching and covers Flow network

COURSE DETAILS

Level:

Type:

Undergraduate

(A-)

Instructors: Ioannis Manolopoulos
Department: Informatics
Institution: Aristotle University of Thessaloniki
Subject: Computer Science, Information Technology, Telecommunications
Rights: CC - Attribution-ShareAlike

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

,
Eastern Macedonia and Thrace Institute of Technologie

VASSILIS
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Konstandinos Randos
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Ioannis Chalamanis
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Dimitrios Katevas
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

Dimitrios Pogaridis
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

espa en
GUnet

© Copyright 2016 - GUnet