Related papers: Shortest paths in arbitrary plane domains
The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…
The search is based on the preliminary transformation of matrices or adjacency lists traditionally used in the study of graphs into projections cleared of redundant information (refined) followed by the selection of the desired shortest…
Let $\mathbb{G}_{n,\gamma}$ be the set of simple and connected graphs on $n$ vertices and with domination number $\gamma$. The graph with minimum spectral radius among $\mathbb{G}_{n,\gamma}$ is called the minimizer graph. In this paper, we…
It is well known that plane curves with the same endpoints are homotopic. An analogous claim for plane curves with the same endpoints and bounded curvature still remains open. In this work we find necessary and sufficient conditions for two…
Given a point $s$ and a set of $h$ pairwise disjoint polygonal obstacles of totally $n$ vertices in the plane, we present a new algorithm for building an $L_1$ shortest path map of size O(n) in $O(T)$ time and O(n) space such that for any…
We construct a path-connected homogenous compactum with cellularity 2^omega that is not homeomorphic to any product of dyadic compacta and first countable compacta. We also prove some closure properties for classes of spaces defined by…
The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and…
An oriented graph is a directed graph with no bi-directed edges, i.e. if $xy$ is an edge then $yx$ is not an edge. The oriented size Ramsey number of an oriented graph $H$, denoted by $r(H)$, is the minimum $m$ for which there exists an…
Given a set of sources and a set of sinks as points in the Euclidean plane, a directed network is a directed graph drawn in the plane with a directed path from each source to each sink. Such a network may contain nodes other than the given…
The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…
We consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path lengths and the minimization of the diameter. We show that it is NP-complete to decide whether a graph has an orientation such that…
An "origami" (or flat structure) on a closed oriented surface, $S_g$, of genus $g \geq 2$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom one. The main…
We consider a bounded domain $\Omega$ of $\mathbb{R}^N$, $N\geq 3$, and $h$ a continuous function on $\Omega$. Let $\Gamma$ be a closed curve contained in $\Omega$. We study existence of positive solutions $u\in H^1_0(\Omega)$ to the…
The concept of path homotopy has received widely attention in the field of path planning in recent years. In this article, a homotopy invariant based on convex dissection for a two-dimensional bounded Euclidean space is developed, which can…
Given a plane curve $\gamma: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(\gamma)$ of inflections which curves $\mbox{diff}(\gamma)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms…
Let $\kappa'(G)$ be the edge connectivity of $G$ and $G\times H$ the direct product of $G$ and $H$. Let $H$ be an arbitrary dense graph with minimal degree $\delta(H)>|H|/2$. We prove that for any graph $G$, $\kappa'(G\times…
Let $H$ be a fixed graph and let $G$ be an $H$-minor free $n$-vertex graph with integer edge weights and no negative weight cycles reachable from a given vertex $s$. We present an algorithm that computes a shortest path tree in $G$ rooted…
We define an analogue of the shortest-path distance for graphons. The proposed method is rooted on the extension to graphons of Varadhan's formula, a result that links the solution of the heat equation on a Riemannian manifold to its…
We provide a mathematical framework for identifying the shortest path in a maze using a Grover walk, which becomes non-unitary by introducing absorbing holes. In this study, we define the maze as a network with vertices connected by…
Given a Jordan domain $\Omega\subset\mathbb{C}$ and two disjoint arcs $A, B$ on $\partial\Omega$, the modulus $m$ of the curve family connecting $A$ and $B$ in $\Omega$ is equal to the modulus of the curve family connecting the vertical…