Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Graph
Search

Course

MATH-360: Graph theory

Summary

The course aims to introduce the basic concepts and results of modern Graph Theory.

Lectures

Instructor

Oliver Janzer

Official source

https://edu.epfl.ch/coursebook/en/graph-theory-MATH-360

Moodle Page

http://go.epfl.ch/MATH-360

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Summary

The course aims to introduce the basic concepts and results of modern Graph Theory.

Lectures

Instructor

Oliver Janzer

Official source

https://edu.epfl.ch/coursebook/en/graph-theory-MATH-360

Moodle Page

http://go.epfl.ch/MATH-360

About this result

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related courses (31)

CS-450: Algorithms II

A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...

MATH-467: Probabilistic methods in combinatorics

The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that if the object is chosen at random, then it has the desir ...

ME-427: Networked control systems

This course offers an introduction to control systems using communication networks for interfacing sensors, actuators, controllers, and processes. Challenges due to network non-idealities and opportunities offered by communication will be analyzed. ...

PHYS-512: Statistical physics of computation

The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and machine learning. ...

CS-250: Algorithms I

The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, s ...