Adaptive Network Visualization (B02)

我们计划将应力最小化方法扩展到一般的图形布局。当前的算法在特定类别的输入图上失败，例如，由于比例、直径或偏斜度分布。此外，输出设备的特性和用户交互通常被忽略。自适应算法应从图形特征对布局特征的影响的定量描述发展而来。由于需要进行广泛的算法实验来经验地理解这些算法的响应曲线，我们也将对实验算法的方法论做出贡献。

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.