arXiv:1608.08909cs.CG
A Sparse Stress Model
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.
Graphistry is impressive, but not free, and needs their server and an API key. You probably already know about graphviz sfdp (not interactive). There's been interesting recent work on distributed maxent optimization https://arxiv.org/pdf/1506.04383.pdf and sparse stress models…
MurrayHill1980View on HNParent context