English
Related papers

Related papers: Constructing embedded surfaces for cellular embedd…

200 papers

Let $\Gamma_g$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We introduce a combinatorial structure of "core surfaces", that represent subgroups of $\Gamma_g$. These structures are (usually)…

Group Theory · Mathematics 2022-06-22 Michael Magee , Doron Puder

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

Combinatorics · Mathematics 2022-05-04 Dominic van der Zypen

Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis…

Social and Information Networks · Computer Science 2024-03-27 Michaël Fanuel , Antoine Aspeel , Michael T. Schaub , Jean-Charles Delvenne

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…

Social and Information Networks · Computer Science 2025-09-11 Francesco Zigliotto , Desmond J. Higham

Classes of branched surfaces extend the classes of surfaces or 2-dimensional manifolds satisfying suitable properties and defined in various manners. Reeb spaces of smooth maps of suitable classes into surfaces whose codimensions are…

General Topology · Mathematics 2022-08-16 Naoki Kitazawa

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…

Machine Learning · Statistics 2014-06-03 Dominique Perrault-Joncas , Marina Meila

The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…

Data Structures and Algorithms · Computer Science 2018-03-16 Giordano Da Lozzo , David Eppstein , Michael T. Goodrich , Siddharth Gupta

A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…

Combinatorics · Mathematics 2026-01-16 Meike Weiß , Reymond Akpanya , Alice C. Niemeyer

The classical theorem of F\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of F\'{a}ry's theorem to surfaces equipped with…

Computational Geometry · Computer Science 2017-08-29 Alfredo Hubard , Vojtěch Kaluža , Arnaud de Mesmay , Martin Tancer

The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…

Combinatorics · Mathematics 2023-05-09 Nicholas Ercolani , Joceline Lega , Brandon Tippings

Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…

Computational Geometry · Computer Science 2015-05-08 Jean Cardinal , Vincent Kusters

In 1970, Lawson solved the topological realization problem for minimal surfaces in the sphere, showing that any closed orientable surface can be minimally embedded in $\mathbb{S}^3$. The analogous problem for surfaces with boundary was…

Differential Geometry · Mathematics 2024-02-21 Mikhail Karpukhin , Robert Kusner , Peter McGrath , Daniel Stern

Unlike $\mathbb{R}^{3}$, the homogeneous spaces $\mathbb{E}(-1,\tau)$ have a great variety of entire vertical minimal graphs. In this paper we explore conditions which guarantees that a minimal surface in $\mathbb{E}(-1,\tau)$ is such a…

Differential Geometry · Mathematics 2017-06-22 Vanderson Lima

Many complex systems involve interactions between more than two agents. Hypergraphs capture these higher-order interactions through hyperedges that may link more than two nodes. We consider the problem of embedding a hypergraph into…

Social and Information Networks · Computer Science 2023-01-06 Xue Gong , Desmond J. Higham , Konstantinos Zygalakis

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

Social and Information Networks · Computer Science 2018-11-30 Jiankai Sun , Srinivasan Parthasarathy

We prove a structural characterization of graphs that forbid a fixed graph $H$ as an immersion and can be embedded in a surface of Euler genus $\gamma$. In particular, we prove that a graph $G$ that excludes some connected graph $H$ as an…

Combinatorics · Mathematics 2013-03-27 Archontia C. Giannopoulou , Marcin Kaminski , Dimitrios M. Thilikos

The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…

Combinatorics · Mathematics 2012-03-06 Guanghua Dong , Ning Wang , Yuanqiu Huang , Han Ren , Yanpei Liu

The aim of this paper is to extend classic results of the theory of CMC surfaces in the product spaces to the class of immersed surfaces in $\mathbb{M}^2(\kappa)\times\mathbb{R}$ whose mean curvature is given as a $C^1$ function depending…

Differential Geometry · Mathematics 2018-07-31 Antonio Bueno

We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…

Combinatorics · Mathematics 2015-01-07 Steven Schluchter

We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional…

Data Structures and Algorithms · Computer Science 2016-07-19 Glencora Borradaile , Erin Wolf Chambers , Kyle Fox , Amir Nayyeri
‹ Prev 1 3 4 5 6 7 10 Next ›