Campus Event Calendar
Event Entry
What and Who
Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
Yunfan Wang
Tsinghua University
PhD Application Talk
AG 1, AG 2, AG 3, INET, AG 4, AG 5, D6, SWS, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 29 January 2025
13:30
30 Minutes
Virtual talk
zoom
Abstract
This talk presents the first deterministic algorithm that makes sub-quadratic queries to find the global minimum cut of a simple graph in the cut query model. I will also try to explain my understanding of the cut problem.
Contact
Ina Geisler
+49 681 9325 1802
--email hidden
Virtual Meeting Details
Zoom
passcode not visible
logged in users only
Ina Geisler, 01/24/2025 12:28 -- Created document.