|Mittagsseminar Talk Information|
Date and Time: Thursday, July 07, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Yoshio Okamoto (Toyohashi University of Technology)
All-pairs shortest paths with real weights in O(n3 /log n) time
I will explain a recent paper of Timothy Chan. He gave a new
algorithm for the all-pairs shortest paths problem running in
O(n3/log n) time. This is the fastest known algorithm for
this problem, and quite simple.
All-pairs shortest paths with real weights in O(n3/log n) time.
Proc. 9th WADS, 2005, to appear.
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