Analysis of Graph Layout Algorithms for Use in Command and Control Network Graphs

This research is intended to determine which styles of layout algorithm are well suited to Command and Control (C2) network graphs to replace current manual layout methods. Manual methods are time intensive and an automated layout algorithm should decrease the time spent creating network graphs. Simulations on realistic synthetically generated graphs provide information to help infer which algorithms perform better than others on this problem. Data is generated using statistics drawn from multiple real world C2 network graphs. The three algorithms tested against this data are the Spectral algorithm, the Dot algorithm, and the Fruchterman-Reingold algorithm. The results include a multiple objective statistics designed to inform on the algorithms performance in both aesthetic characteristics defined in literature, as well as some characteristics defined by the research sponsor. The results suggest that the Dot algorithm performs better with respect to the sponsor defined characteristics, whereas the Fruchterman-Reingold algorithm performs better on aesthetic characteristics