Compact Graph Drawing with Port Constraints

• Applicants: Professor Dr. Reinhard von Hanxleden; Professorin Dr. Petra Mutzel
• Subject Area: Theoretical Computer Science
• Term: from 2014 to 2018
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 250885464

The goal of this project is to design new algorithms for drawing graphs, with the special focus on compactness and port constraints. Our compactness goal is to minimize the area of the smallest bounding box around the drawing while achieving an ideal aspect ratio. The new methods shall be analyzed with respect to different aesthetics criteria, enabling us to compare them with each other and with previous methods. For the empirical evaluation we will use classical benchmark sets used in graph drawing as well as data flow diagrams used in the area of embedded systems. These contributions could directly be employed in industrial applications, since automatic graph layout is now increasingly becoming a very relevant functionality for the model-based design process of embedded systems.

• DFG Programme: Research Grants