New for: D1, D2, D3
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.