The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...