scientific article; zbMATH DE number 5764857

MaRDI QIDQ3579450zbMATH OpenFDO

Authors Liam Roditty, Lee-Ad Gottlieb

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational aspects related to convexity (52B55) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(21)

• Temporal cliques admit sparse spanners
• Local routing in a tree metric 1-spanner
• Incremental algorithm for maintaining a DFS tree for undirected graphs
• Low dimensional embeddings of doubling metrics
• Randomization for efficient dynamic graph algorithms (invited talk)
• New Doubling Spanners: Better and Simpler
• On locality-sensitive orderings and their applications
• An Optimal Dynamic Spanner for Doubling Metric Spaces
• The greedy spanner is existentially optimal
• On Locality-Sensitive Orderings and Their Applications
• Temporal cliques admit sparse spanners
• Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
• Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
• Kinetic spanners in \(\mathbb R^{d}\)
• On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
• Fully dynamic geometric spanners
• A unified framework for light spanners
• A unified framework of light spanners. I: Fast (yet optimal) constructions
• Optimal Euclidean tree covers
• Optimal Euclidean tree covers
• Pattern matching in doubling spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579450)