A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Incremental algorithms for minimal length paths
Journal of Algorithms
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
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
Fully dynamic algorithms for maintaining shortest paths trees
Journal of 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
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
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
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
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Chain programming over difference constraints
Nordic Journal of Computing
Improved distance sensitivity oracles via random sampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Discovering correlated spatio-temporal changes in evolving graphs
Knowledge and Information Systems
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Accomplishing approximate FCFS fairness without queues
HiPC'07 Proceedings of the 14th international conference on High performance computing
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
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks
Science of Computer Programming
Tesseract: a 4D network control plane
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Analyzing chain programs over difference constraints
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
An information-centric architecture for data center networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
Fully dynamic randomized algorithms for graph spanners
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
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The beacon openflow controller
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
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
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
| Hi-index | 0.01 |
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynamic algorithm for general directed graphs with non-negative real-valued edge weights that supports any sequence of operations in O(n2log3n) amortized time per update and unit worst-case time per distance query, where n is the number of vertices. We can also report shortest paths in optimal worst-case time. These bounds improve substantially over previous results and solve a long-standing open problem. Our algorithm is deterministic, uses simple data structures, and appears to be very fast in practice.