Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Faster dynamic matchings and vertex connectivity
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Theoretical Computer Science
Dynamic plane transitive closure
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing
New data structures for subgraph connectivity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Faster geometric algorithms via dynamic determinant computation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Hi-index | 0.00 |
We consider dynamic evaluation of algebraic functions such as computing determinant, matrix adjoint, matrix inverse and solving linear system of equations. We show that in the dynamic setup the above problems can be solved faster than evaluating everything from scratch. In the case when rows and columns of the matrix can change we show an algorithm that achieves O(n虏) arithmetic operations per update and O(1) arithmetic operations per query. Next, we describe two algorithms, with different tradeoffs, for updating the inverse and determinant when single entries of the matrix are changed. The fastest update for the first tradeoff is 0(n^{1.575} ) arithmetic operations per update and O(n^{0.575} ) arithmetic operations per query. The second tradeoff gives O(n^{1.495} ) arithmetic operations per update and O(n^{1.495} ) arithmetic operations per query. We also consider the case when some number of columns or rows can change. We use dynamic determinant computations to solve the following problems in the dynamic setup: computing the number of spanning trees in a graph and testing if an edge in a graph is contained in some perfect matching. These are the first dynamic algorithms for these problems. Next, with the use of dynamic matrix inverse, we solve fully dynamic transitive closure in general directed graphs. The bounds on arithmetic operations for dynamic matrix inverse translate directly to time bounds for dynamic transitive closure. Thus we obtain the first known algorithm with O(n虏) worstcase update time and constant query time and two algorithms for transitive closure in general digraphs with subquadratic update and query times. Our algorithms for transitive closure are randomized with one-sided error. We also consider for the first time the case when the edges incident with a part of vertices of the graph can be changed.