Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs
Information Processing Letters
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
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
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Maintenance of Transitive Closures and Transitive Reductions of Graphs
WG '87 Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
Oracles for distances avoiding a link-failure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining all-pairs approximate shortest paths under deletion of edges
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A faster and simpler fully dynamic transitive closure
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
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
Improved Distance Oracles for Avoiding Link-Failure
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th 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
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
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
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks
IEEE Transactions on Computers
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Does path cleaning help in dynamic all-pairs shortest paths?
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Adaptive fastest path computation on a road network: a traffic mining approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A faster and simpler fully dynamic transitive closure
ACM Transactions on Algorithms (TALG)
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
Discovering correlated spatio-temporal changes in evolving graphs
Knowledge and Information Systems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A nearly optimal oracle for avoiding failed vertices and edges
Proceedings of the forty-first annual ACM symposium on Theory of computing
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Dynamic plane transitive closure
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
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
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 Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Knuth-Bendix completion as a data structure
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
An experimental study of algorithms for fully dynamic transitive closure
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
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The impact of edge deletions on the number of errors in networks
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Dynamic graph query primitives for SDN-based cloudnetwork management
Proceedings of the first workshop on Hot topics in software defined networks
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Incremental algorithm for updating betweenness centrality in dynamically growing networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Incremental closeness centrality for dynamically changing social networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
This paper presents the first fully dynamic algorithms for maintaining all-pairs shortest paths in digraphs with positive integer weights less than b. For approximate shortest paths with an error factor of \math, for any positive constant \math, the amortized update time is O(n2 log2 n/log log n); for an error factor of \math the amortized update time is \math. For exact shortest paths the amortized update time is \math. Query time for exact and approximate shortest distances is O(1); exact and approximate paths can be generated in time proportional to their lengths.Also presented is a fully dynamic transitive closure algorithm with update time O(n2 log n) and query time O(1). The previously known fully dynamic transitive closure algorithm with fast query time has one-sided error and update time O(n2:28). The algorithms use simple data structures, and are deterministic.