Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure

@article{Demetrescu2007MantainingDM,
  title={Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure},
  author={Camil Demetrescu and Giuseppe F. Italiano},
  journal={Algorithmica},
  year={2007},
  volume={51},
  pages={387-427}
}
In this paper 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 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… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Maintenance of transitive closure and transitive reduction of graphs

J. A. La Poutr e, J. van Leeuwen
In Proc. Workshop on Graph-Theoretic Concepts in Computer Science, • 1988
View 5 Excerpts
Highly Influenced

On-Line Computation of Transitive Closures of Graphs

Inf. Process. Lett. • 1983
View 5 Excerpts
Highly Influenced

Efficient Determination of the Transitive Closure of a Directed Graph

Inf. Process. Lett. • 1971
View 6 Excerpts
Highly Influenced

Trade - offs for fully dynamic reachability on dags : breaking through the O ( n 2 ) barrier

C. Demetrescu, G. F. Italiano
J . Assoc . Comput . Mach . ( J . ACM ) • 2005

Similar Papers

Loading similar papers…