Related papers: Multidimensional $\beta$-skeletons in $L_1$ and $L…
$\beta$-skeletons are well-known neighborhood graphs for a set of points. We extend this notion to sets of line segments in the Euclidean plane and present algorithms computing such skeletons for the entire range of $\beta$ values. The main…
$\beta$-skeletons, a prominent member of the neighborhood graph family, have interesting geometric properties and various applications ranging from geographic networks to archeology. This paper focuses on developing a new, more general than…
The $\beta$-skeleton is a mathematical method to construct graphs from a set of points that has been widely applied in the areas of image analysis, machine learning, visual perception, and pattern recognition. In this work, we apply the…
We perform an extensive numerical analysis of $\beta$-skeleton graphs, a particular type of proximity graphs. In a $\beta$-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter…
We present a new algorithm for lune-based $\beta$-skeletons for sets of $n$ points in the plane, for $\beta \in (2,\infty]$, the only case when optimal algorithms are not known. The running time of the algorithm is $O(n^{3/2} \log^{1/2}…
For $\beta \geq 1$, the \emph{$\beta$-skeleton depth} ($\SkD_\beta$) of a query point $q\in \mathbb{R}^d$ with respect to a distribution function $F$ on $\mathbb{R}^d$ is defined as the probability that $q$ is contained within the…
A {\beta}-skeleton is a proximity graphs with node neighbourhood defined by continuous-valued parameter {\beta}. Two nodes in a {\beta}-skeleton are connected by an edge if their lune-based neighbourhood contains no other nodes. With…
A $(\beta,\delta,\Delta)$-padded decomposition of an edge-weighted graph $G = (V,E,w)$ is a stochastic decomposition into clusters of diameter at most $\Delta$ such that for every vertex $v\in V$, the probability that…
The median of a set of vertices $P$ of a graph $G$ is the set of all vertices $x$ of $G$ minimizing the sum of distances from $x$ to all vertices of $P$. In this paper, we present a linear time algorithm to compute medians in median graphs,…
A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…
In the presented paper we study the Length-Bounded Cut problem for special graph classes as well as from a parameterized-complexity viewpoint. Here, we are given a graph $G$, two vertices $s$ and $t$, and positive integers $\beta$ and…
A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known…
Algorithms are given for determining $L_\infty$ isotonic regression of weighted data. For a linear order, grid in multidimensional space, or tree, of $n$ vertices, optimal algorithms are given, taking $\Theta(n)$ time. These improve upon…
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if $\beta (G)$ is the metric dimension of a maximal outerplanar graph $G$ of order $n$, we prove that $2\le \beta (G) \le \lceil…
The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all…
For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of…
Given a graph $G=(V,E)$, a $\beta$-ruling set is a subset $S\subseteq V$ that is i) independent, and ii) every node $v\in V$ has a node of $S$ within distance $\beta$. In this paper we present almost optimal distributed algorithms for…
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…
The orthogonal beltway problem is the problem of recovering the $\mathrm{O}(n)$-orbit of a $\delta$-function supported at a finite number of points in $\r^n$ from its auto-correlation or, equivalently, second moment. It was introduced as a…