Add to ORKGA sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we design an algorithm in massively parallel computation (MPC) model for constructing a geometric spanner known as Yao-graph. This improves the total time and the total memory of existing algorithms for geometric spanners from subquadratic to near-linear
A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. Given a r...
Data structures that allow efficient distance estimation have been extensively studied both in centr...
© Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. A graph spanner is a fundament...
Yao graphs are geometric spanners that connect each point of a given point set to its nearest neighb...
Over the past decade, there has been increasing interest in distributed/parallel algorithms for proc...
It is an open problem whether Yao-Yao graphs YY_{k} (also known as sparse-Yao graphs) are all spanne...
A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in...
Abstract. Given a set V of n points in R d and a real constant t> 1, we present the first O(n log...
We give algorithms for geometric graph problems in the modern parallel models such as MapReduce [DG0...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner o...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner of...
Given a connected graph G = (V; E) with n vertices and m edges, the distance between two vertices in...
A multiplicative ?-spanner H is a subgraph of G = (V,E) with the same vertices and fewer edges that ...
A t-spanner for a point set S ⊂ Rd is a Euclidean graph G = (S,E) in which the length of the shortes...
AbstractThis paper concerns the efficient construction of sparse and low stretch spanners for unweig...
A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. Given a r...
Data structures that allow efficient distance estimation have been extensively studied both in centr...
© Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. A graph spanner is a fundament...
Yao graphs are geometric spanners that connect each point of a given point set to its nearest neighb...
Over the past decade, there has been increasing interest in distributed/parallel algorithms for proc...
It is an open problem whether Yao-Yao graphs YY_{k} (also known as sparse-Yao graphs) are all spanne...
A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in...
Abstract. Given a set V of n points in R d and a real constant t> 1, we present the first O(n log...
We give algorithms for geometric graph problems in the modern parallel models such as MapReduce [DG0...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner o...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner of...
Given a connected graph G = (V; E) with n vertices and m edges, the distance between two vertices in...
A multiplicative ?-spanner H is a subgraph of G = (V,E) with the same vertices and fewer edges that ...
A t-spanner for a point set S ⊂ Rd is a Euclidean graph G = (S,E) in which the length of the shortes...
AbstractThis paper concerns the efficient construction of sparse and low stretch spanners for unweig...
A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. Given a r...
Data structures that allow efficient distance estimation have been extensively studied both in centr...
© Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. A graph spanner is a fundament...