Keynote address: Why everyone seems to be using spring embedders for network visualization, and should not

Abstract

The main algorithmic challenge in network visualization is the placement of nodes. While plenty of layout algorithms have been proposed, the vast majority of information visualization tools appears to utilize (sometimes a variant of) one of two algorithms: the approach of Fruchterman and Reingold or that of Kamada and Kawai. Both are often referred to as force-directed methods, or spring embedders, and praised for their general applicability, high adaptability, and simplicity. I will argue that commonly used implementations and even the approaches themselves are outdated and, in fact, have always been. They should be replaced by variants of multidimensional scaling that display superior results and scalability, and are just as flexible and easy to implement. Some of these statements may actually be backed by evidence.