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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, November 28, 2023, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Adrian Taubner

The Exact Matching Problem is a graph problem arising in computer science. Given a graph with each edge colored as red or blue, the question is whether there exists a perfect matching with exactly k red edges for a given integer k. While the problem was shown to be solvable in randomized polynomial time in the 1980s, a polynomial time deterministic algorithm for the Exact Matching has so far only been found for restricted classes such as complete and complete bipartite graphs. In this work, we provide additional results and ideas for finding a polynomial time deterministic algorithm for the Exact Matching Problem.

Arguably our most interesting result is using outcomes of the Edmond Blossom Weighted Algorithm to show a deterministic polynomial time algorithm for finding a Second Minimum Matching. We demonstrate how this could be extended to an algorithm finding a k-Minimum Matching and solving the Minimum + C Matching Problem in exponential time, with k, C serving as exponents.

Last but not least, we provided a deterministic polynomial time modification that transforms a Correct Parity Matching into a Second Minimum Matching in bipartite graphs.

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