Drawing large graphs by low-rank stress majorization

Optimizing a stress model is a natural technique for drawing graphs: one seeks an embedding into R^d which best preserves the induced graph metric. Current approaches to solving the stress model for a graph with |ν| nodes and |ε| edges require the full all-pairs shortest paths (APSP) matrix, which takes O(|ν|2 log |ε|+|ν||ε|) time and O(|ν|²) space. We propose a novel algorithm based on a low-rank approximation to the required matrices. The crux of our technique is an observation that it is possible to approximate the full APSP matrix, even when only a small subset of its entries are known. Our algorithm takes time O(k|ν|+|ν| log|ν|+|ε|) per iteration with a preprocessing time of O(k³ +k(|ε|+|ν| log|ν|)+k2|ν|) and memory usage of O(k|ν|), where a user-defined parameter k trades off quality of approximation with running time and space. We give experimental results which show, to the best of our knowledge, the largest (albeit approximate) full stress model based layouts to date. Computer Graphics Forum