Computational Complexity of Edge Bundling Problems Joelma de Moura Ferreira Hugo Alexandre Dantas do Nascimento Aaron Quigley Les Foulds Edge Bundling Computational Complexity Graph Drawing Combinatorial Optimization Edge bundling is a technique to visually group, align, coordinate and position the depiction of edges in a node-link graph drawing, so that sets of edges appear to be brought together into shared visual structures, i.e. bundles. The ultimate goal is to visually simplify the drawing to improve how it conveys information. Edge bundling has been extensively studied and can successfully reduce visual clutter. However, there is a lack of fundamental theoretical principles that can be used to objectively measure the effectiveness of bundling techniques and to compare various proposed algorithms. In addition, the computational complexity of this type of problem has not been fully studied to date. In this paper, we provide a general formulation for the edge bundling problem, as a formal combinatorial optimization problem. This allows for the definition and conceptual comparison of various types of edge bundling techniques. In addition, we define a simplified edge bundling problem and prove its NP-completeness. We also propose an enhanced edge bundling problem with maximum angle constraint and propose an integer linear programming model for it. 12 06 2017 Technical Report PDF RT-INF_001-17 RT-INF_001-17.pdf Inglês Este trabalho pode ser usado irrestritamente, desde que sejam dados os devidos créditos aos seus autores