|Saturday 3 June 2023|
|Events for day: Wednesday 25 May 2022|
| 14:00 - 15:00 Combinatorics and Computing Weekly Seminar|
Space of Complexity of Estimating the Maximum Matching Size
In this presentation, I will talk about the recent results on the maximum matching problem in the data stream model. The main focus of the talk will be on the algorithms for estimating the maximum matching size and the related space lower bounds for graphs with bounded arboricity such as planar graphs.
To get more information about the Combinatorics and Computing Weekly Seminar and webinars Zoom link, join the following google group: