相关论文: Multidimensional $\beta$-skeletons in $L_1$ and $L…

We review geometrical properties of a static spacetime $(M,g)$, including geodesic completeness, causality, standard splittings, compact $M$, closed geodesics and geodesic connectedness. We pay special attention to the critical quadratic…

We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d-Hitting Set that runs in time n^{O(d^2 + d/\epsilon})}, uses…

We present a functional data analysis approach for studying time-dependent, continuous glucose monitoring data with repeated measures for each individual in an experiment. After scaling the glucose concentration curves to the interval [0,…

A four-dimensional differentiable manifold is given with an arbitrary linear connection $\Gamma_\alpha^\beta=\Gamma_{i\alpha}^\beta dx^i$. Megged has claimed that he can define a metric $G_{\alpha\beta}$ by means of a certain integral…

We consider the problem of computing the size of each $r$-neighbourhood for every vertex of a graph. Specifically, we ask whether the size of the closed second neighbourhood can be computed in subquadratic time. Adapting the SETH reductions…

Let $G$ be a planar $3$-graph (i.e., a planar graph with vertex degree at most three) with $n$ vertices. We present the first $O(n^2)$-time algorithm that computes a planar orthogonal drawing of $G$ with the minimum number of bends in the…

We study the recently introduced boolean-width of graphs. Our structural results are as follows. Firstly, we show that almost surely the boolean-width of a random graph on $n$ vertices is $O(\log^2 n)$, and it is easy to find the…

A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q \in S$ is at most $t$ times the original distance between $p$ and~$q$. We study geometric…

This paper proposes a family of graph metrics for measuring distances between graphs of different sizes. The proposed metric family defines a general form of the graph generalised optimal sub-pattern assignment (GOSPA) metric and is also…

We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…

Coudert et al. (SODA'18) proved that under the Strong Exponential-Time Hypothesis, for any $\epsilon >0$, there is no ${\cal O}(2^{o(k)}n^{2-\epsilon})$-time algorithm for computing the diameter within the $n$-vertex cubic graphs of…

We consider the moment map $m:\mathbb{P}V_n\rightarrow \text{i}\mathfrak{u}(n)$ for the action of $\text{GL}(n)$ on $V_n=\otimes^{2}(\mathbb{C}^{n})^{*}\otimes\mathbb{C}^{n}$, and study the functional $F_n=\|m\|^{2}$ restricted to the…

In this paper we will discuss the derivation of the so-called vanishing beta function curves which can be used to explore the fixed point structure of the theory under consideration. This can be applied to the O($N$) symmetric theories,…

The tsNET algorithm utilizes t-SNE to compute high-quality graph drawings, preserving the neighborhood and clustering structure. We present three fast algorithms for reducing the time complexity of tsNET algorithm from O(nm) time to O(n log…

Let $G=(V,E)$ be a connected graph and $d_{G}(u,v)$ be the shortest distance between the vertices $u$ and $v$ in $G$. A set $S=\{s_{1},s_{2},\cdots,s_{n}\}\subset V(G)$ is said to be a {\em resolving set} if for all distinct vertices $u,v$…

We introduce a new geometric spanner, $\delta$-Greedy, whose construction is based on a generalization of the known Path-Greedy and Gap-Greedy spanners. The $\delta$-Greedy spanner combines the most desirable properties of geometric…

Given an undirected graph $G$, the problem of deciding whether $G$ admits a simple and proper time-labeling that makes it temporally connected is known to be NP-hard (G\"obel et al., 1991). In this article, we relax this problem and ask…

We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$,…

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best…

Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbours, the following can be done in O(scan(n)) I/Os, provided M…