Campus Event Calendar
Event Entry
New for: D1, D2, D3
What and Who
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
C.R. Subramanian
Max-Planck-Institut für Informatik - AG 1
AG1 Advanced Mini-Course
AG 1, AG 2, AG 3
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 26 August 99
13:30
60 Minutes
46
024
Saarbrücken
Abstract
I will talk about an efficient fully dynamic graph algorithm for maintaining the
transitive closure of a directed graph. The queries are reachability queries. The
updates allowed are insertion and/or deletion of edges incident to a vertex,
insertion and/or deletion of a vertex. These results are presented in a paper by
Valerie King and Garry Sager with the above-mentioned title. This paper appears
in the STOC'99 proceedings.
Contact
C. R. Subramanian
--email hidden
passcode not visible
logged in users only