Abstract
An attempt was made to obtain new dynamic algorithms for maintaining the transitive closure of a directed graph, and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. The algorithms were obtained by combining several new ideas, one of which is a simple sampling idea used for detecting decompositions of strongly connected components. Results on estimating the size of the transitive closure to the dynamic setting were also employed.
| Original language | English |
|---|---|
| Pages (from-to) | 679-688 |
| Number of pages | 10 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 2002 |
| Event | The 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada Duration: 16 Nov 2002 → 19 Nov 2002 |