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: Tuesday, February 20, 2024, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Simon Meierhans

Incremental Cycle Detection via Dynamic Minimum Cost Flow

In this talk, I will discuss a new almost-linear time algorithm for maintaining a minimum cost flow on a dynamic graph undergoing edge insertions. This result settles the time complexity of many basic problems on such incremental graphs via simple reductions, including the detection of an occurrence of a directed cycle and the approximate maintenance of st-distances. This talk is based on joint work with Li Chen, Rasmus Kyng, Yang P. Liu, and Maximilian Probst Gutenberg.

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