Adaptive Network Visualization (B02)

• Subject Area: Theoretical Computer Science
• Term: from 2015 to 2019
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 251654672

We plan to extend stress-minimization approaches for general graph layout. Current algorithms fail on specific classes of input graphs, for instance because of scale, diameter, or skewed degree distributions. Moreover, characteristics of the output device and user interactions are generally ignored. Adaptive algorithms shall be developed from quantitative descriptions of the effects of graph characteristics on layout features. Since extensive algorithmic experimentation will be required to understand empirically the response curves of such algorithms, we will also contribute to methodology in experimental algorithmics.

• DFG Programme: CRC/Transregios
• Subproject of: TRR 161: Quantitative Methods for Visual Computing
• Applicant Institution: Universität Stuttgart
• Co-Applicant Institution: Universität Konstanz
• Project Head: Professor Dr. Ulrik Brandes