26.01.23, Eero Raty, Recent advances in cut-problems on graphs (Lecture 5)
Автор: IBS Extremal Combinatorics and Probability Group
Загружено: 2026-02-07
Просмотров: 21
Описание:
IBS ECOPRO 2026 Winter School
https://www.ibs.re.kr/ecopro/winter-2...
Eero Raty, Recent advances in cut-problems on graphs (Lecture 1)
January 23 2026, Friday, @10:00AM - 11:30AM KST
IBS room B332
SPEAKER
Eero Raty
IBS ECOPRO, Korea
https://www.umu.se/en/staff/eero-raty...
This mini-course will serve as an introduction to cut problems in graphs and related topics. The course will begin by covering the basics of spectral graph theory, including the Alon–Boppana theorem and the expander mixing lemma. We will then introduce some fundamental tools in the field, such as the Goemans–Williamson algorithm, along with its applications to various types of max-cut problems in graphs and hypergraphs. Towards the end of the course, we will explore recent advancements in the area, which rely on more involved spectral properties of adjacency matrices.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
