The worst graph layout algorithm ever

Anonymous

Keywords: graph layout algorithm, linear programming, graph drawing, optimal, crossings

TL;DR: Researchers have been trying to make graph drawings more readable by minimizing the number of crossings. What happens if we do the opposite?

Abstract: Graph layout algorithms strive to improve the utility of node-link visualizations or graph drawings by optimizing for readability criteria. One such criteria that has been widely used is to count edge crossings. Prior work has focused solely on \emphasize{minimizing} the number of edge crossings, including provably-optimal layout algorithms for layered graphs. The research community has completely ignored the other side of the coin - can we optimally maximize edge crossings? This paper answers this question in the affirmative. Our WORSTisfimal layout algorithm produces the most unreadable layered graph drawing. It does so by using linear programming to produce a provably-optimally-awful solution. We hope that this groundbreaking result opens up an entirely new field of inquiry for graph drawing researchers - optimally-worst layout algorithms.