Subscribe

Redondo Beach, California

Nov. 12, 2000 to Nov. 14, 2000

ISBN: 0-7695-0850-2

pp: 381

C. Demetrescu , Dipartimento di Inf. e Sistemistica, Rome Univ., Italy

ABSTRACT

We introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure, in particular we devise a deterministic algorithm for general directed graphs that achieves O(n/sup 2/) amortized time for updates, while preserving unit worst-case cost for queries. In case of deletions only, our algorithm performs updates faster in O(n) amortized time. Our matrix-based approach yields an algorithm for directed acyclic graphs which breaks through the O(n/sup 2/) barrier on the single-operation complexity of fully dynamic transitive closure. We can answer queries in O(n/sup /spl epsiv//) time and perform updates in O(n/sup /spl omega/(1,/spl epsiv/,1)-/spl epsiv//+n/sup 1+/spl epsiv//) time, for any /spl epsiv//spl isin/[0,1], where /spl omega/(1,/spl epsiv/,1) is the exponent of the multiplication of an n/spl times/n/sup /spl epsiv// matrix by an n/sup /spl epsiv///spl times/n matrix. The current best bounds on /spl omega/(1,/spl epsiv/,1) imply an O(n/sup 0.575/) query time and an O(n/sup 1.575/) update time. Our subquadratic algorithm is randomized, and has one-side error.

INDEX TERMS

directed graphs; polynomials; matrix multiplication; computational complexity; randomised algorithms; deterministic algorithms; fully dynamic transitive closure; polynomials; matrix multiplication; deterministic algorithm; directed graphs; unit worst-case cost; queries; amortized time; directed acyclic graphs; single-operation complexity; subquadratic algorithm; randomized algorithm

CITATION

C. Demetrescu,
"Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier",

*FOCS*, 2000, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2000, pp. 381, doi:10.1109/SFCS.2000.892126