Abstract
In this paper we study the problem of transitive closure in dynamic directed plane graphs. We show a dynamic algorithm supporting updates and queries in worst-case \(\tilde{O}(\sqrt{n})\) time. This is the first known algorithm for this problem with almost linear update time and query time product.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demetrescu, C., Italiano, G.F.: Fully Dynamic Transitive Closure: Breaking Through the O(n 2) Barrier. In: Proceedings of 41th annual IEEE Symposium on Foundations of Computer Science, pp. 381–389. IEEE Computer Society Press, Los Alamitos (2000)
Eppstein, D., Galil, Z., Italiano, G.F., Spencer, T.H.: Separator based sparsification for dynamic planar graph algorithms. In: STOC 1993. Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp. 208–217. ACM Press, New York, USA (1993)
Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5), 868–889 (2006)
Henzinger, M.R., King, V.: Fully Dynamic Biconnectivity and Transitive Closure. In: Proceedings 36th annual IEEE Symposiumon Foundations of Computer Science, pp. 664–672 (1995)
Husfeldt, T.: Fully dynamic transitive closure in plane dags with one source and one sink. In: European Symposium on Algorithms, pp. 199–212 (1995)
Khanna, S., Motwani, R., Wilson, R.H.: On Certificates and Lookahead on Dynamic Graph Problems. In: Proceedings 7th annual ACM-SIAM Symposiumon on Discrete Algorithms, pp. 222–231 (1996)
King, V.: Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. In: Proceedings of 40th annual IEEE Symposium on Foundations of Computer Science, pp. 81–91. IEEE Computer Society Press, Los Alamitos (1999)
King, V., Sagert, G.: A Fully Dynamic Algorithm for Maintaining the Transitive Closure. In: Proceedings of the thirty-first annual ACM Symposium on Theory of Computing, pp. 492–498. ACM Press, New York (1999)
Klein, P.N., Subramanian, S.: A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol. 709, pp. 442–451. Springer, Heidelberg (1993)
Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Applied Math., 177–189 (1979)
Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. In: STOC 1984. Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp. 376–382. ACM Press, New York (1984)
Roditty, L.: A Faster and Simpler Fully Dynamic Transitive Closure. In: Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 404–412. ACM Press, New York (2003)
Roditty, L., Zwick, U.: Improved Dynamic Reachability Algorithms for Directed Graphs. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, p. 679. IEEE Computer Society Press, Los Alamitos (2002)
Roditty, L., Zwick, U.: A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. In: Proceeding of the 36th annual ACM Symposium on Theory of Computing, pp. 184–191. ACM Press, New York (2004)
Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse. In: Proceedings of the 45th annual IEEE Symposium on Foundations of Computer Science, pp. 248–255. IEEE Computer Society Press, Los Alamitos (2004)
Subramanian, S.: A fully dynamic data structure for reachability in planar digraphs. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol. 726, pp. 372–383. Springer, Heidelberg (1993)
Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993–1024 (2004)
Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Trans. Algorithms 1(1), 2–13 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diks, K., Sankowski, P. (2007). Dynamic Plane Transitive Closure. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-75520-3_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75519-7
Online ISBN: 978-3-540-75520-3
eBook Packages: Computer ScienceComputer Science (R0)