6 papers
On Turn-Regular Orthogonal Representations
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista +5
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other…
Turning Cliques into Paths to Achieve Planarity
Patrizio Angelini, Peter Eades, Seok-Hee Hong +5
Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call -Clique2Path Planarity: Given a graph , whose vertices…
High-Dimensional Data Visualization by Interactive Construction of Low-Dimensional Parallel Coordinate Plots
Takayuki Itoh, Ashnil Kumar, Karsten Klein +1
Parallel coordinate plots (PCPs) are among the most useful techniques for the visualization and exploration of high-dimensional data spaces. They are especially useful for the repr…
A Note on the Practicality of Maximal Planar Subgraph Algorithms
Markus Chimani, Karsten Klein, Tilo Wiedera
Given a graph , the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of with the maximum number of edges. There are several heuristic, approximative,…
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Markus Chimani, Giuseppe Di Battista, Fabrizio Frati +1
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
The Open Graph Archive: A Community-Driven Effort
Christian Bachmaier, Franz J. Brandenburg, Philip Effinger +6
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimenta…