Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, October 30, 2001, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Carsten Lange
A path between a pair of vertices is a sequence of edges such that consecutive edges share a vertex. The lenght of a path is the number of its edges. What is the the maximal length of a shortest path? The main idea Forman used to obtain an upper bound is varying a hypothetical shortest path. Unfortunately, an assumption on the combinatorics of the polytope is needed.
Automatic MiSe System Software Version 1.4803M | admin login