Related papers: An SPQR-Tree-Like Embedding Representation for Upw…
Tabular data in relational databases represents a significant portion of industrial data. Hence, analyzing and interpreting tabular data is of utmost importance. Application tasks on tabular data are manifold and are often not specified…
Representation learning for knowledge graphs (KGs) has focused on the problem of answering simple link prediction queries. In this work we address the more ambitious challenge of predicting the answers of conjunctive queries with multiple…
Learning the representation of data with hierarchical structures in the hyperbolic space attracts increasing attention in recent years. Due to the constant negative curvature, the hyperbolic space resembles tree metrics and captures the…
Simultaneous embedding is concerned with simultaneously representing a series of graphs sharing some or all vertices. This forms the basis for the visualization of dynamic graphs and thus is an important field of research. Recently there…
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…
The increasing complexity of data requires methods and models that can effectively handle intricate structures, as simplifying them would result in loss of information. While several analytical tools have been developed to work with complex…
We use the techniques of birational algebraic geometry and some combinatorial arguments related to weighted trees to study the structure of resolutions of compactifications of hypothetical counterexamples to the two-dimensional Jacobian…
Given a set $P$ of $n$ red and blue points in the plane, a \emph{planar bichromatic spanning tree} of $P$ is a spanning tree of $P$, such that each edge connects between a red and a blue point, and no two edges intersect. In the bottleneck…
Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and…
Relational representation learning has lately received an increase in interest due to its flexibility in modeling a variety of systems like interacting particles, materials and industrial projects for, e.g., the design of spacecraft. A…
We study the Steiner tree problem on map graphs, which substantially generalize planar graphs as they allow arbitrarily large cliques. We obtain a PTAS for Steiner tree on map graphs, which builds on the result for planar edge weighted…
We review the structure of gauge theory scattering amplitudes at tree level and describe how a compact expression can be found which encodes all the tree-level amplitudes in the maximally supersymmetric N=4 theory. The expressions for the…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…
A Schnyder wood is an orientation and coloring of the edges of a planar map satisfying a simple local property. We propose a generalization of Schnyder woods to graphs embedded on the torus with application to graph drawing. We prove…
We derive a variant of the loop-tree duality for Feynman integrals in the Schwinger parametric representation. This is achieved by decomposing the integration domain into a disjoint union of cells, one for each spanning tree of the graph…
We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…
Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…