Related papers: Minimal Paths on Some Simple Surfaces with Singula…
Consider a strictly convex bounded regular domain $C$ of $\R^3$. For any arbitrary finite topological type we find a compact Riemann surface $\mathcal{M}$, an open domain $M\subset \mathcal{M}$ with the fixed topological type, and a…
We prove the existence of a minimal diffeomorphism isotopic to the identity between two hyperbolic cone surfaces $(\Sigma,g_1)$ and $(\Sigma,g_2)$ when the cone angles of $g_1$ and $g_2$ are different and smaller than $\pi$. When the cone…
We prove that closed surfaces of all topological types, except for the non-orientable odd-genus ones, can be minimally embedded in the Riemannian product of a sphere and a circle of arbitrary radius. We illustrate it by obtaining some…
The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order $n$ whose metric subgraphs are all paths if and only…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
A minimal knot is the intersection of a topologically embedded branched minimal disk in $\mathbb{R}^4$ $\mathbb{C}^2 $ with a small sphere centered at the branch point. When the lowest order terms in each coordinate component of the…
The composition problem for shortest paths asks the following: given shortest paths on weighted graphs M and N which share a common boundary, find the shortest paths on their union. This problem is a crucial step in any algorithm which uses…
Let $G$ be a directed planar graph of complexity $n$, each arc having a nonnegative length. Let $s$ and $t$ be two distinct faces of $G$; let $s_1,...,s_k$ be vertices incident with $s$; let $t_1,...,t_k$ be vertices incident with $t$. We…
We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
The software system under test can be modeled as a graph comprising of a set of vertices, (V) and a set of edges, (E). Test Cases are Test Paths over the graph meeting a particular test criterion. In this paper, we present a method to…
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry. Applications include shortest paths in traffic networks with variable link travel times.
Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are…
Given a minimal surface equipped with a generically finite map to an Abelian variety, we give an optimal bound on the canonical degree of a rational or an elliptic curve. As a corollary, we obtain the finiteness of rational and elliptic…
A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…
We show that for a closed surface of genus at least 5, or a surface of genus at least 2 with at least one marked point, the set of uniquely ergodic foliations and the set of cobounded foliations is path-connected and locally path-connected.
Shortest paths play an important role in mathematical modeling and image processing. Usually, shortest path problems are formulated on planar graphs that consist of vertices and weighted arcs. In this context, one is interested in finding a…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least…
The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…