scientific article
From MaRDI portal
Publication:3579450
zbMath1192.90025MaRDI QIDQ3579450
Liam Roditty, Lee-Ad J. Gottlieb
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Computational aspects related to convexity (52B55) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (17)
On Locality-Sensitive Orderings and Their Applications ⋮ Pattern matching in doubling spaces ⋮ Incremental algorithm for maintaining a DFS tree for undirected graphs ⋮ New Doubling Spanners: Better and Simpler ⋮ An Optimal Dynamic Spanner for Doubling Metric Spaces ⋮ On Locality-Sensitive Orderings and Their Applications ⋮ Kinetic spanners in \(\mathbb R^{d}\) ⋮ Unnamed Item ⋮ Randomization for Efficient Dynamic Graph Algorithms ⋮ Temporal cliques admit sparse spanners ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Fully dynamic geometric spanners ⋮ Temporal Cliques Admit Sparse Spanners ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ ⋮ Local routing in a tree metric \(1\)-spanner ⋮ Low dimensional embeddings of doubling metrics
This page was built for publication:
