scientific article; zbMATH DE number 2038725
From MaRDI portal
Publication:4449190
zbMath1039.05056MaRDI QIDQ4449190
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190384.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (19)
Graph spanners in the streaming model: An experimental study ⋮ Small stretch \((\alpha ,\beta )\)-spanners in the streaming model ⋮ Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Spanners for bounded tree-length graphs ⋮ Covering metric spaces by few trees ⋮ Compact routing messages in self-healing trees ⋮ Sublinear fully distributed partition with applications ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ Simple Distributed Spanners in Dense Congest Networks ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Graph spanners: a tutorial review ⋮ Network flow spanners ⋮ Approximating Shortest Paths in Graphs ⋮ Multiplicative Approximations of Random Walk Transition Probabilities ⋮ Covering Metric Spaces by Few Trees ⋮ Distance-Preserving Graph Contractions ⋮ Light Spanners ⋮ Distance-Preserving Graph Contractions
This page was built for publication:
