Fachschaft Mathematik/Informatik

you do not see anything!
DISCONNECTED

Vortragsreihe zu Datenstrukturen und Graphen-Algorithmen an der UPB

14 Jan 2019 14 Jan 2019

Professor Surender Baswana von der Universität Kanpur ist für 18 Monate als Humboldt-Fellow an der Universität Paderborn. Um sich vorzustellen, hält er in den nächsten Wochen jeweils Freitags einen Vortrag. Im Einzelnen

Freitag, 18.01.2019 - Dynamic Graph Algorithms I

Abstract: In this talk we shall discuss the model of dynamic graph algorithms. We shall also discuss the current state of the art for some well known problems in this area. We shall also discuss a few simple dynamic algorithms. We shall also discuss a few open problems in this area.

Freitag, 25.01.2019 - Dynamic Graph Algorithms II

Abstract: In this talk we shall discuss a randomized algorithm for maintaining connectivity in an undirected graph with poly-logarithmic update and query time. This result by Henzinger and King [J. ACM 46(4): 502-516 (1999)] is a milestone in the area of dynamic graph algorithms. This result also demonstrates the power of randomization in the area of dynamic graph algorithms.

Freitag, 01.02.2019 - Dynamic Graph Algorithms III

Abstract: Depth First Search (DFS) is a fundamental technique to traverse a graph and is used for solving a variety of graph problems. A DFS traversal produces a rooted tree called a DFS tree. In this talk we shall discuss the dynamic algorithms for maintaining a DFS tree. We shall also discuss a few open problems on dynamic DFS.

Die Vorträge werden jeweils Freitags, 13.00 Uhr, in Raum F1.110 stattfinden.