Author:
Demetrescu Camil,Italiano Giuseppe F.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251–280 (1990)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
4. Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: breaking through the O(n 2) barrier. In: Proc. of the 41st IEEE Annual Symposium on Foundations of Computer Science (FOCS’00), pp. 381–389 (2000)
5. Demetrescu, C., Italiano, G.F.: Trade-offs for fully dynamic reachability on dags: breaking through the O(n 2) barrier. J. Assoc. Comput. Mach. (J. ACM) 52(2), 147–156 (2005)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic Fully Dynamic SSSP and More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Subquadratic dynamic path reporting in directed graphs against an adaptive adversary;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Adding Edges for Maximizing Weighted Reachability;Algorithms;2020-03-18
4. Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier;SIAM Journal on Computing;2019-01
5. Decremental single-source reachability in planar digraphs;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19