Pages that link to "Item:Q5435671"
From MaRDI portal
The following pages link to A new approach to dynamic all pairs shortest paths (Q5435671):
Displayed 47 items.
- The impact of dynamic events on the number of errors in networks (Q265066) (← links)
- Decremental algorithm for adaptive routing incorporating traveler information (Q339637) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights (Q528469) (← links)
- A mechanical verification of the stressing algorithm for negative cost cycle detection in networks (Q532429) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Computing inversion pair cardinality through partition-based sorting (Q956693) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789) (← links)
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- On the robustness of the metric dimension of grid graphs to adding a single edge (Q2143039) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- Partially dynamic efficient algorithms for distributed shortest paths (Q2268860) (← links)
- Disk-based shortest path discovery using distance index over large dynamic graphs (Q2292955) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs (Q2805514) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs (Q3467869) (← links)
- On memoryless provers and insincere verifiers (Q3639202) (← links)
- (Q5002673) (← links)
- (Q5009521) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- (Q5090485) (← links)
- (Q5091161) (← links)
- (Q5092428) (← links)
- (Q5116480) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- A Forward-Backward Single-Source Shortest Paths Algorithm (Q5255013) (← links)
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time (Q5862374) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
- Optimizing the ecological connectivity of landscapes (Q6179718) (← links)