Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, $(SGD)^{2}$ ( S G D ) 2

Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying data. With few exceptions, graph drawing algorithms typically optimize one such criterion, usually at the expense of others. We propose a layout approach, Multicriteria Scalable Graph Drawing via Stochastic Gradient Descen...