no code implementations • 15 Dec 2020 • Steven Chaplick, Jonathan Rollin, Torsten Ueckerdt
For a class $\mathcal{D}$ of drawings of loopless (multi-)graphs in the plane, a drawing $D \in \mathcal{D}$ is \emph{saturated} when the addition of any edge to $D$ results in $D' \notin \mathcal{D}$ - this is analogous to saturated graphs in a graph class as introduced by Tur\'an (1941) and Erd\H{o}s, Hajnal, and Moon (1964).
Computational Geometry Discrete Mathematics Combinatorics
no code implementations • 23 Apr 2013 • Lukas Barth, Stephen Kobourov, Sergey Pupyrev, Torsten Ueckerdt
We study the problem of computing semantic-preserving word clouds in which semantically related words are close to each other.
