scientific article; zbMATH DE number 6469155
From MaRDI portal
Publication:5501268
zbMath1317.68062MaRDI QIDQ5501268
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Signed and weighted graphs (05C22)
Related Items (7)
Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Path-Fault-Tolerant Approximate Shortest-Path Trees ⋮ Approximate distance oracles for graphs with dense clusters ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ Approximate shortest paths guided by a small index ⋮ Approximating Shortest Paths in Graphs ⋮ All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
This page was built for publication:
