Improved Dynamic Reachability Algorithms for Directed Graphs

Improved Dynamic Reachability Algorithms for Directed Graphs (2002)

by Liam Roditty , Uri Zwick

Citations:

23 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Improved Dynamic Reachability Algorithms for Directed Graphs	user correction - Legacy Corrections
AUTHOR NAME	Liam Roditty	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science, Tel Aviv University	SVM HeaderParse 0.2
AUTHOR ADDR	Tel Aviv 69978, Israel	SVM HeaderParse 0.1
AUTHOR NAME	Uri Zwick	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science, Tel Aviv University	SVM HeaderParse 0.2
AUTHOR ADDR	Tel Aviv 69978, Israel	SVM HeaderParse 0.1
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.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	184--191	INFERENCE
CITATIONS	22 found	ParsCit 1.0