Campus Event Calendar
Event Entry
New for: D1, D2, D3, INET, D4, D5
What and Who
New Perspectives on Old Graph Questions (Video Talk)
Danupon Nanonkai
KTH Stockholm
INF Distinguished Lecture Series
AG 1, AG 2, AG 3, INET, AG 4, AG 5, SWS, RG1, MMCI
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 6 April 2020
10:00
60 Minutes
E1 4
024
Saarbrücken
Abstract
In this talk, I will discuss an ambitious research program towards graph algorithms that work efficiently across many computational models. I will provide an overview of new results and techniques coming out of this research program. Results that will be discussed include edge connectivity (global minimum cut), vertex connectivity, and maximum matching. No background is required, except for some very basic graph algorithms.
Contact
Kurt Mehlhorn
--email hidden
Video Broadcast
Yes
0
passcode not visible
logged in users only
Uwe Brahm, 04/20/2020 18:03
Kurt Mehlhorn, 04/02/2020 11:45
Kurt Mehlhorn, 04/02/2020 09:57 -- Created document.
Kurt Mehlhorn, 04/02/2020 11:45
Kurt Mehlhorn, 04/02/2020 09:57 -- Created document.