Abstract
We report progress on dynamic complexity of well-known graph problems such as reachability and matching. In this model, edges are dynamically added and deleted and we measure the complexity of each update/query. We propose polynomial-size data structures for such updates for several related problems. The updates are in very low level complexity classes such as quantifier-free first order formulas, AC 0[2],TC 0. In particular, we show the following problems are in the indicated classes:
-
(a)
maximum matching in non-uniform DynTC 0;
-
(b)
digraph reachability in non-uniform DynAC 0[2];
-
(c)
embedded planar digraph reachability in DynFO(= uniform DynAC 0).
Notably, the part (c) of our results yields the first non-trivial class of graphs where reachability can be maintained by first-order updates; it is a long-standing open question whether the same holds for general graphs. For (a) we show that the technique in [7] can in fact be generalized using [8] and [9] to maintain the determinant of a matrix in DynTC 0. For (b) we extend this technique with the help of two more ingredients namely isolation [1,13] and truncated approximation using rational polynomials. In fact, our proof yields DynAC 0[p]bound for any prime pā>ā1. For (c) we exploit the duality between cuts and cycles in planar graphs to maintain the number of crossings between carefully chosen primal and dual paths, using several new structural lemmas.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting uniform and nonuniform upper bounds. J. Comput. Syst. Sci.Ā 59(2), 164ā181 (1999)
Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. TOCTĀ 1(1) (2009)
Datta, S., Kulkarni, R., Roy, S.: Deterministically isolating a perfect matching in bipartite planar graphs. Theory Comput. Syst.Ā 47(3), 737ā757 (2010)
Dong, G., Su, J.: Incremental and decremental evaluation of transitive closure by first-order queries. Information and ComputationĀ 120(1), 101ā106 (1995)
GrƤdel, E., Siebertz, S.: Dynamic definability. In: ICDT, pp. 236ā248 (2012)
Hesse, W.: Dynamic computational complexity. Ph.D. thesis, U. Mass. (2003)
Hesse, W.: The dynamic complexity of transitive closure is in DynTC0. Theor. Comput. Sci.Ā 296(3), 473ā485 (2003)
Hesse, W., Allender, E., Barrington, D.A.M.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci.Ā 65(4), 695ā716 (2002)
Mahajan, M., Vinay, V.: Determinant: Combinatorics, algorithms, and complexity. Chicago J. Theor. Comput. Sci. 1997 (1997)
Mehta, J.C.: Dynamic Complexity of Planar 3-connected Graph Isomorphism. In: CSR (accepted, 2014)
Miller, G.L., Naor, J.: Flow in planar graphs with multiple sources and sinks. SIAM J. Comput.Ā 24(5), 1002ā1017 (1995)
Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. CombinatoricaĀ 7(1), 101ā104 (1987)
Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. CombinatoricaĀ 7(1), 105ā113 (1987)
Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. Journal of Computer and System SciencesĀ 55(2), 199ā209 (1997)
Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM J. Comput.Ā 29(4), 1118ā1131 (2000)
Schwentick, T.: Perspectives of Dynamic Complexity. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol.Ā 8071, pp. 33ā33. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-642-39992-3-6
Vollmer, H.: Introduction to circuit complexity - a uniform approach. Texts in theoretical computer science. Springer (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, S., Hesse, W., Kulkarni, R. (2014). Dynamic Complexity of Directed Reachability and Other Problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-43948-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43947-0
Online ISBN: 978-3-662-43948-7
eBook Packages: Computer ScienceComputer Science (R0)