Related papers: Upward Point-Set Embeddability

Stick graphs are defined as follows. Let A (respectively B) be a set of vertical (respectively horizontal) segments in the plane such that the bottom endpoints of the segments in A and the left endpoints of the segments in B lie on the same…

An upward drawing of a tree is a drawing such that no parents are below their children. It is order-preserving if the edges to children appear in prescribed order around each node. Chan showed that any tree has an upward order-preserving…

In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a…

We study the following problem introduced by Dujmovic et al. Given a tree $T = (V,E)$, on $n$ vertices, a set of $n$ lines $\mathcal{L}$ in the plane and a bijection $\iota: V \rightarrow \mathcal{L}$, we are asked to find a crossing-free…

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…

Given a network and a subset of interesting vertices whose identities are only partially known, the vertex nomination problem seeks to rank the remaining vertices in such a way that the interesting vertices are ranked at the top of the…

Using an obstruction based on Donaldson's theorem on the intersection forms of definite 4-manifolds, we determine which connected sums of lens spaces smoothly embed in S^4. We also find constraints on the Seifert invariants of Seifert…

Transformer architectures rely on explicit position encodings in order to preserve a notion of word order. In this paper, we argue that existing work does not fully utilize position information. For example, the initial proposal of a…

In this paper we study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation exists. On the other hand, we give an efficient algorithm…

Deep neural networks for machine comprehension typically utilizes only word or character embeddings without explicitly taking advantage of structured linguistic information such as constituency trees and dependency trees. In this paper, we…

In this note, we study the geometric structure of the parameter sets governing continuous embeddings between weighted Bergman-Orlicz spaces. First, for a fixed pair of growth functions, we show that the set of admissible weight exponents…

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

Network embedding is an effective technique to learn the low-dimensional representations of nodes in networks. Real-world networks are usually with multiplex or having multi-view representations from different relations. Recently, there has…

Over the past years, embedding learning on networks has shown tremendous results in link prediction tasks for complex systems, with a wide range of real-life applications. Learning a representation for each node in a knowledge graph allows…

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Networks are one of the most powerful structures for modeling problems in the real world. Downstream machine learning tasks defined on networks have the potential to solve a variety of problems. With link prediction, for instance, one can…

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…