Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, October 29, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Thomas Liphardt

Finding a Heaviest Triangle is not Harder than Matrix Multiplication (student talk, 45 min.)

The main result of this paper is that finding a heaviest triangle in a vertex-weighted graph on n vertices can be done in the same asymptotic time as finding any triangle. The best algorithm currently known for the latter problem needs time O(n2.376), which is the time needed by the best known algorithm for multiplying two n x n - matrices. The proof of this result is surprisingly elementary, even more so considering that no subcubic algorithm for this problem was known until STOC 2006.

Paper by Artur Czumaj and Andrzej Lingas: Finding a Heaviest Triangle is not Harder than Matrix Multiplication, Proc. of the 18th Symposium on Discrete Algorithms (SODA) 2007.

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

Previous talks by year:   2025  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