Campus Event Calendar
Event Entry
What and Who
Graph Traversal
Ulrich Meyer
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
-- Not specified --
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 22 November 2000
13:30
45 Minutes
46
024
Saarbrücken
Abstract
I will present a simple external memory algorithm for
BFS, DFS and SSSP on planar graphs with o(n) I/Os.
Furthermore, I will sketch a SSSP algorithm that achieves
linear time on average.
Contact
Ulrich Meyer
0681-9325-125
--email hidden
passcode not visible
logged in users only