Experimental Evaluation of Book Drawing Algorithms

• Published in: Graph Drawing and Network Visualization pp. 224 - 238
• Main Authors: Klawitter, Jonathan, Mchedlidze, Tamara, Nöllenburg, Martin
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Book Draw; Book Embedding; Book Thickness; Construction Heuristics; Graph Classes
• ISBN: 9783319739144; 331973914X
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-73915-1_19

A k-page book drawing of a graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=(V,E)$$\end{document} consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the kpages, 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.