scientific article; zbMATH DE number 6783475

zbMath1376.68061MaRDI QIDQ5365123

Aaron Bernstein, Liam Roditty

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133140

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization

This page was built for publication: