10 citations · 54 across the 49 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat +1
In edge orientations, the goal is usually to orient (direct) the edges of an undirected -vertex graph such that all out-degrees are bounded. When the graph is fully dyna…
cs.DS2013★ 2 cited
From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics
Shay Solomon
In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any -point doubling metric, any $\eps > 0$, and any integer $0…