DMCA
Improved Dynamic Reachability Algorithms for Directed Graphs (2002)
| Citations: | 35 - 3 self |
BibTeX
@INPROCEEDINGS{Roditty02improveddynamic,
author = {Liam Roditty and Uri Zwick},
title = {Improved Dynamic Reachability Algorithms for Directed Graphs},
booktitle = {},
year = {2002},
pages = {184--191}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We obtain several 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. Among our algorithms are: (i) A decremental algorithm for maintaining the transitive closure of a directed graph, through an arbitrary sequence of edge deletions, in O(mn) total expected time, essentially the time needed for computing the transitive closure of the initial graph. Such a result was previously known only for acyclic graphs.
