Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
On-line computation of minimal and maximal length paths
Theoretical Computer Science
Dynamic algorithms for shortest paths in planar graphs
Theoretical Computer Science
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Space-bounded FOIES (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Maintaining transitive closure in first order after node-set and edge-set deletions
Information Processing Letters
A data structure for arc insertion and regular path finding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Bounded Incremental Computation
Bounded Incremental Computation
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Maintaining Constrained Transitive Closure by Conjunctive Queries
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
Incremental Evaluation of Datalog Queries
ICDT '92 Proceedings of the 4th International Conference on Database Theory
First-order Definability over Constraint Databases
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
We give incremental algorithms, which support both edge insertions and deletions, for the all-pairs shortest-distance problem (APSD) in weighted undirected graphs. Our algorithms use first-order queries, + (addition) and O(n2) number of tuples, where n is the number of vertices, and have AC0 data complexity for integer weights. Since FO(+,