Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, October 28, 2008, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Peter Sanders (Univ. Karlsruhe)
We present filterKruskal -- a simple modification of Kruskal's minimum spanning tree algorithm that avoids sorting edges that are ``obviously'' not in the MST. For arbitrary graphs with random edge weights, filterKruskal runs in time O(m + n\log n log m/n), i.e. in linear time for not too sparse graphs. Experiments indicate that the algorithm has very good practical performance over the entire range of edge densities. An equally simple parallelization seems to be the currently best practical algorithm on multi-core machines.
This talk will focus on the analysis and open problems.
Automatic MiSe System Software Version 1.4803M | admin login