A new approach to dynamic all pairs shortest paths
From MaRDI portal
(Redirected from Publication:5435671)
A new approach to dynamic all pairs shortest paths (scientific article; zbMATH DE number 5226310)
A new approach to dynamic all pairs shortest paths (scientific article; zbMATH DE number 5226310)
Recommendations
Cited in
(78)- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
- A fully dynamic algorithm for distributed shortest paths.
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- A branch-checking algorithm for all-pairs shortest paths
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- Analyzing unit read-once refutations in difference constraint systems
- Approximating dynamic weighted vertex cover with soft capacities
- On the robustness of the metric dimension of grid graphs to adding a single edge
- Improved distance sensitivity oracles with subcubic preprocessing time
- Partially dynamic efficient algorithms for distributed shortest paths
- Disk-based shortest path discovery using distance index over large dynamic graphs
- Solving all-pairs shortest path by single-source computations: theory and practice
- Incremental algorithm for maintaining a DFS tree for undirected graphs
- Fully dynamic all pairs shortest paths with real edge weights
- The impact of dynamic events on the number of errors in networks
- Randomization for efficient dynamic graph algorithms (invited talk)
- Maintaining shortest paths under deletions in weighted directed graphs
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Algorithmic techniques for maintaining shortest routes in dynamic networks
- Computing all-pairs shortest paths by leveraging low treewidth
- A survey on combinatorial optimization in dynamic environments
- Experimental analysis of dynamic all pairs shortest path algorithms
- On Dynamic DFS Tree in Directed Graphs
- Fully dynamic all-pairs shortest paths: breaking the O(n) barrier
- Decremental algorithm for adaptive routing incorporating traveler information
- Dynamic single-source shortest paths in Erdős-Rényi random graphs
- A new approach to dynamic all pairs shortest paths
- On memoryless provers and insincere verifiers
- scientific article; zbMATH DE number 3900809 (Why is no real title available?)
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited
- scientific article; zbMATH DE number 2086658 (Why is no real title available?)
- Finding large k-clubs in undirected graphs
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
- An \(o(1)\)-approximation algorithm for dynamic weighted vertex cover with soft capacity
- Decremental SPQR-trees for Planar Graphs
- Decremental strongly connected components and single-source reachability in near-linear time
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- Dominating sets and connected dominating sets in dynamic graphs
- Algorithms and hardness for diameter in dynamic graphs
- Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
- An improved algorithm for incremental DFS tree in undirected graphs
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- A forward-backward single-source shortest paths algorithm
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
- A mechanical verification of the stressing algorithm for negative cost cycle detection in networks
- All-pairs shortest paths in \(O(n^2)\) time with high probability
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
- scientific article; zbMATH DE number 6469167 (Why is no real title available?)
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Directed shortest paths via approximate cost balancing
- Unit read-once refutations for systems of difference constraints
- Optimizing the ecological connectivity of landscapes
- Average update times for fully-dynamic all-pairs shortest paths
- A new deterministic algorithm for fully dynamic all-pairs shortest paths
- Deterministic incremental APSP with polylogarithmic update time and stretch
- Directed shortest paths via approximate cost balancing
- Distance queries over dynamic interval graphs
- New tradeoffs for decremental approximate all-pairs shortest paths
- Finding short tree-like unit refutations in UTVPI constraint systems
- Distance queries over dynamic interval graphs
- Efficient maximum Euclidean distance transform computation in component trees using the differential image foresting transform
- On approximating optimal weight ``no-certificates in weighted difference constraint systems
- Decremental APSP in unweighted digraphs versus an adaptive adversary
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- Fully dynamic algorithms for minimum weight cycle and related problems
- On maximal k-edge-connected subgraphs of undirected graphs
- Undirected 3-fault replacement path in nearly cubic time
- On incremental approximate shortest paths in directed graphs
- Optimal length resolution refutations of difference constraint systems
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Reconstructing shortest paths
- Computing inversion pair cardinality through partition-based sorting
- Maintaining dynamic minimum spanning trees: an experimental study
This page was built for publication: A new approach to dynamic all pairs shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5435671)
