Scaling algorithms for network problems
Journal of Computer and System Sciences
Constructing a perfect matching is in random NC
Combinatorica
A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Maintenance of transitive closures and transitive reductions of graphs
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Maximum matchings in general graphs through randomization
Journal of Algorithms
Faster scaling algorithms for network problems
SIAM Journal on Computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Incremental algorithms for minimal length paths
Journal of Algorithms
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Flow in Planar Graphs with Multiple Sources and Sinks
SIAM Journal on Computing
On the computational complexity of dynamic graph problems
Theoretical Computer Science
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
On dynamic algorithms for algebraic problems
Journal of Algorithms
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Fast rectangular matrix multiplication and applications
Journal of Complexity
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
Fully dynamic algorithms for maintaining shortest paths trees
Journal of Algorithms
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A faster and simpler fully dynamic transitive closure
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Dynamic Reachability Algorithms for Directed Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A New Approach to Maximum Matching in General Graphs
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Fully Dynamic Data Structure for Reachability in Planar Digraphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Using expander graphs to find vertex connectivity
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Algebraic Structures and Algorithms for Matching and Matroid Problems
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Faster dynamic matchings and vertex connectivity
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Dynamic Normal Forms and Dynamic Characteristic Polynomial
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Fast Dynamic Transitive Closure with Lookahead
Algorithmica
Dynamic plane transitive closure
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Hi-index | 0.00 |
The aim of this paper is to survey the results on dynamic algebraic algorithms, with main interest in matrix functions such as, determinant, inverse, rank and characteristic polynomial. First of all we summary the papers that in dynamic setup these problems can be solved faster than evaluating everything from scratch. The static complexity of these problem equals the matrix multiplication complexity, whereas the presented solutions work in subquadratic or quadratic (characteristic polynomial) time in the worst case. The dynamic matrix computations can be used to solve the following graphs problems in dynamic setup: computing transitive closure, computing shortest paths lengths, computing maximum matching size and computing vertex connectivity. For all of these problem the dynamic approach lead to the first known subquadratic algorithms. Astonishingly, the dynamic matrix algorithms can be used to obtain efficient static algorithms for the perfect matching problem as well. Using the O(n2) algorithms for the dynamic matrix inverse, one can obtain a very simple randomized algorithm for computing perfect matchings in O(n3) time. When the fast matrix multiplication is used, the complexity of this algorithm can be improved to O(n茂戮驴) time, where 茂戮驴is the exponent of the best known matrix multiplication algorithm. Since 茂戮驴O(n2.5) barrier for the matching problem. The interplay between algebraic algorithms and graphs problems can be explored even further in order to obtain O(Wn茂戮驴) time algorithms for single source shortest paths problem and weighted bipartite matching problem.