|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 21, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Claudia Käppeli
Maximum Matchings via Gaussian Elimination
I will present a randomized algorithm for finding maximum matchings in
general graphs. The algorithm has running time O(nw), where w is the
exponent of the best known matrix multiplication algorithm. Since w < 2.38,
this algorithm breaks through the O(n2.5) barrier for the matching problem.
Marcin Mucha and Piotr Sankowski, "Maximum Matchings via Gaussian Elimination", FOCS 2004, pp. 248-257.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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.3392 | admin login