Doppelkolloquiumsvortrag, Prof. Dr. Ulrich Meyer, Algorithm Engineering Group, Institute of Computer Science, Goethe University, Frankfurt / 27.05.2016, 16:15 - 17:30 Uhr

27.05.2016 von 16:15 bis 17:30

Institut für Informatik, Ludewig-Meyn-Straße 2, 24118 Kiel, Raum: Übungsraum 2/K

Titel: Generating and Traversing Large Graphs in External-Memory


Large graphs arise naturally in many real world applica-
tions. The actual performance of simple RAM model algo-
rithms for traversing these graphs (stored in external mem-
ory) deviates significantly from their linear or near-linear
predicted performance because of the large number of I/Os
they incur. In order to alleviate the I/O bottleneck, many
external memory graph traversal algorithms have been de-
signed with provable worst-case guarantees. In the talk I
highlight some techniques used in the design and engineer-
ing of such algorithms and survey the state-of-the-art in
I/O-efficient graph traversal algorithms. I will also report
on recent work concerning the generation of massive scale
free networks under resource constraints.


Prof. Srivastav

Diesen Termin meinem iCal-Kalender hinzufügen