Related papers: Constructing embedded surfaces for cellular embedd…
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…
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…
In this work, we study the perception problem for sampled surfaces (possibly with boundary) using tools from computational topology, specifically, how to identify their underlying topology starting from point-cloud samples in space, such as…
In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…
In this paper, we consider the simplest class of stratified spaces -- linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled…
An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding $f$ of a graph $G$ into $\mathbb{R}^3$ is free, if $\pi_1(\mathbb{R}^3-f(G))$ is a free…
Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal…
The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…
We construct the first smooth embedded compact special Legendrian surfaces in \(\mathbb S^5\) of genus greater than one. More precisely, for every sufficiently large integer \(k\), we construct an embedded special Legendrian surface whose…
We call a (not necessarily planar) embedding of a graph $G$ in the plane \emph{sequential} if its vertices lie in $\mathbb Z^2$ and the line segments between adjacent vertices contain no interior integer points. In this note, we prove (i) a…
Massive network exploration is an important research direction with many applications. In such a setting, the network is, usually, modeled as a graph $G$, whereas any structural information of interest is extracted by inspecting the way…
Let $G=(V,E)$ be an arbitrary undirected source graph to be embedded in a target graph $EM$, the extended grid with vertices on integer grid points and edges to nearest and next-nearest neighbours. We present an algorithm showing how to…
We prove that the isometric embedding of any metric of differentiability class C1 in E3 exists. We use simplified notation for the given metric, namely geodesic parameters, and level parameters for the embedded surface in E3. Central to our…
A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked…
We consider a surface $M$ immersed in $\mathbb{R}^3$ with induced metric $g=\psi\delta_2$ where $\delta_2$ is the two dimensional Euclidean metric. We then construct a system of partial differential equations that constrain $M$ to lift to a…
Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line…
Graphs are a representation of structured data that captures the relationships between sets of objects. With the ubiquity of available network data, there is increasing industrial and academic need to quickly analyze graphs with billions of…