Experimental Evaluation of Book Drawing Algorithms

Klawitter, Jonathan and Mchedlidze, Tamara and Nöllenburg, Martin (2017) Experimental Evaluation of Book Drawing Algorithms. In: Graph Drawing and Network Visualization, GD 2017, September 25-27 , pp. 224-238(Official URL: https://doi.org/10.1007/978-3-319-73915-1_19).

Full text not available from this repository.


A k-page book drawing of a graph G=(V,E) consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the k pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if they are assigned to the same page and their vertices alternate along the spine. Crossing minimization in a k-page book drawing is NP-hard, yet book drawings have multiple applications in visualization and beyond. Therefore several heuristic book drawing algorithms exist, but there is no broader comparative study on their relative performance. In this paper, we propose a comprehensive benchmark set of challenging graph classes for book drawing algorithms and provide an extensive experimental study of the performance of existing book drawing algorithms.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.490 Embeddings
P Styles > P.999 Others
S Software and Systems > S.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1605

Actions (login required)

View Item View Item