Related papers: Distance and intersection number in the curve grap…
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These…
Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…
A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…
The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbacks including oversized search space, huge memory…
For a connected graph $G$, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix $\mathcal{D}^S(G)$. Suppose that the eigenvalues of $\mathcal{D}^S(G)$ be $\partial_{1}^{S}(G)…
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…
We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…
Motivation: Surface generation and visualization are some of the most important tasks in biomolecular modeling and computation. Eulerian solvent excluded surface (ESES) software provides analytical solvent excluded surface (SES) in the…
Curves play a fundamental role across computer graphics, physical simulation, and mathematical visualization, yet most tools for curve design do nothing to prevent crossings or self-intersections. This paper develops efficient algorithms…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
Let $G=(V,E)$ be a connected simple graph. The distance $d(u,v)$ between vertices $u$ and $v$ from $V$ is the number of edges in the shortest $u-v$ path. If $e=uv \in E$ is an edge in $G$ than distance $d(w,e)$ where $w$ is some vertex in…
Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such…
The diameter of a graph is the maximum distance among all pairs of vertices. Thus a graph $G$ has diameter $d$ if any two vertices are at distance at most $d$ and there are two vertices at distance $d$. We are interested in studying the…
A graph $G=(V,E)$ is a geometric intersection graph if every node $v \in V$ is identified with a geometric object of some particular type, and two nodes are adjacent if the corresponding objects intersect. Geometric intersection graph…
For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…
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 large number of powerful, high-quality, and open-source simulation packages exist to efficiently perform molecular dynamics simulations, and their prevalence has greatly accelerated discoveries across a wide range of scientific domains.…
Modern supervised learning techniques, particularly those using deep nets, involve fitting high dimensional labelled data sets with functions containing very large numbers of parameters. Much of this work is empirical. Interesting phenomena…
Let $S_g$ denote a closed, orientable surface of genus $g \geq 2$ and $\mathcal{C}(S_g)$ be the associated curve complex. The mapping class group of $S_g$, $Mod(S_g)$ acts on $\mathcal{C}(S_g)$ by isometries. Since Dehn twists about certain…
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses,…