Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 30, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Julian Portmann

Sublinear Time Arboricity Approximation

The arboricity arb(G) of a graph G is the minimum number of forests needed to cover all its edges. Recently, Eden, Mossel, and Ron [SODA'22] gave a randomized sublinear time algorithm for computing a O(log²n) approximation of arboricity with (near-optimal) Õ(n / arb(G)) queries, where a query is reading the degree or the i-th neighbor of a given vertex.

In this talk, I will present a simple randomized algorithm that improves this approximation to O(log n) with the same number of queries. This is joint work with Mohsen Ghaffari.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login