Improved dynamic reachability algorithms for directed graphs

Liam Roditty; Uri Zwick

Improved dynamic reachability algorithms for directed graphs

Liam Roditty^*
, Uri Zwick

^*Corresponding author for this work

School of Computer Science and AI

Tel Aviv University

Research output: Contribution to journal › Conference article › peer-review

39 Scopus citations

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

Cite this

@article{cc31af597555449791aff89b0e7a3345,

title = "Improved dynamic reachability algorithms for directed graphs",

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.",

author = "Liam Roditty and Uri Zwick",

year = "2002",

language = "אנגלית",

pages = "679--688",

journal = "Annual Symposium on Foundations of Computer Science - Proceedings",

issn = "0272-5428",

publisher = "IEEE Computer Society",

note = "The 34rd Annual IEEE Symposium on Foundations of Computer Science ; Conference date: 16-11-2002 Through 19-11-2002",

}

TY - JOUR

T1 - Improved dynamic reachability algorithms for directed graphs

AU - Roditty, Liam

AU - Zwick, Uri

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0036954330

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0036954330

SN - 0272-5428

SP - 679

EP - 688

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

T2 - The 34rd Annual IEEE Symposium on Foundations of Computer Science

Y2 - 16 November 2002 through 19 November 2002

ER -

Improved dynamic reachability algorithms for directed graphs

Abstract

Other files and links

Fingerprint

Cite this