# Dynamic transitive closure with immediate new reachability facts

The typical definition of dynamic transitive closure (or reachability) uses two types of queries: the first one is an update (edge deletion/insertion) and the second one is a reachability query. Thus, most works on time complexity provide separated estimations on update operation and reachability query evaluation. But what about the case when one wants to get new reachability facts immediately on the update? So, we have only update queries, and as a result of each edge insertion we want to get all new reachable pairs (for edge deletion --- all pairs that became unreachable, for example). Are there any results on the theoretical time complexity of such a case?

• I'm interested in such a case because incremental transitive closure with such behavior is a part of a context-free path querying algorithm that we are working on. Briefly: we have an iterative algorithm that supports transitive closure of directed graph $G$, at each iteration adds new edges in the $G$, and uses newly reachable pairs to calculate edges that should be added at the next iteration. So, we want to use existing results to provide accurate time complexity analysis. – gsv Jan 8 at 17:35