Related papers: Highway Dimension: a Metric View
Latent space models assume that network ties are more likely between nodes that are closer together in an underlying latent space. Euclidean space is a popular choice for the underlying geometry, but hyperbolic geometry can mimic more…
We consider a path-planning scenario for a mobile robot traveling in a configuration space with obstacles under the presence of stochastic disturbances. A novel path length metric is proposed on the uncertain configuration space and then…
Let $G$ be a connected graph. Given an ordered set $W = \{w_1, w_2,\dots w_k\}\subseteq V(G)$ and a vertex $u\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\dots,$ $d(u,w_k))$, where…
A set of vertices $W$ {\em resolves} a graph $G$ if every vertex of $G$ is uniquely determined by its vector of distances to the vertices in $W$. The {\em metric dimension} for $G$, denoted by $\dim(G)$, is the minimum cardinality of a…
Simple heuristics often show a remarkable performance in practice for optimization problems. Worst-case analysis often falls short of explaining this performance. Because of this, "beyond worst-case analysis" of algorithms has recently…
Given a connected graph $G(V, E)$, the edge dimension, denoted $\mathrm{edim}(G)$, is the least size of a set $S \subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of…
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…
Metric dimension is an essential parameter in graph theory that aids in addressing issues pertaining to information retrieval, localization, network design, and chemistry through the identification of the least possible number of elements…
In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…
This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension of $\Gamma$ is the smallest size of…
The problem of realizing finite metric spaces in terms of weighted graphs has many applications. For example, the mathematical and computational properties of metrics that can be realized by trees have been well-studied and such research…
We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires…
Road network is a critical infrastructure powering many applications including transportation, mobility and logistics in real life. To leverage the input of a road network across these different applications, it is necessary to learn the…
Low density graphs are considered to be a realistic graph class for modelling road networks. It has advantages over other popular graph classes for road networks, such as planar graphs, bounded highway dimension graphs, and spanners. We…
A map is an abstract visual representation of a region, taken from a given space, usually designed for final human consumption. Traditional cartography focuses on the mapping of Euclidean spaces by using some distance metric. In this paper…
Autonomous driving for urban and highway driving applications often requires High Definition (HD) maps to generate a navigation plan. Nevertheless, various challenges arise when generating and maintaining HD maps at scale. While recent…
A heavy path in a weighted graph represents a notion of connectivity and ordering that goes beyond two nodes. The heaviest path of length l in the graph, simply means a sequence of nodes with edges between them, such that the sum of edge…
This paper gives a rigorous interpretation of a Feynman path integral on a Riemannian manifold M with non-positive sectional curvature. A $L^2$ Riemannian metric $G_P$ is given on the space of piecewise geodesic paths $H_P(M)$ adapted to…