2008.11.04 |
| Date | Thu Nov 06 |
| Time | 14:15 — 15:00 |
| Location | Turing 014 |
Title: Incremental Topological Ordering
Speaker: Deepak Ajwani, Aarhus University, MADALGO
Abstract:
I will present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n^{2.75}) time, independent of the number of edges inserted. I will then show an average case analysis of incremental topological ordering algorithms. After discussing some recent advances inthis area, I will talk about dynamic topological orderingin the external memory model.
Joint work with: Tobias Friedrich, MPI and Ulrich Meyer, J.W. Goethe Universität.
Host: Gerth Stølting Brodal