Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, May 06, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Justus Schwartz
In this talk I will present some results on the average case complexity of the shortest path problem.
The focus will be on the average case complexity of the single source shortest path problem in sparse graphs (O(cn) arcs for some constant c). Mainly we will consider graphs generated according to the extended vertex potential model.
Automatic MiSe System Software Version 1.4803M | admin login