Improved dynamic reachability algorithms for directed graphs

Liam Roditty*, Uri Zwick

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

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 languageEnglish
Pages (from-to)679-688
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 2002
EventThe 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada
Duration: 16 Nov 200219 Nov 2002

Fingerprint

Dive into the research topics of 'Improved dynamic reachability algorithms for directed graphs'. Together they form a unique fingerprint.

Cite this