Graph layout algorithms are used to compute aesthetic and useful visualizations of graphs.
In general, for graphs with up to a few hundred nodes, force-directed layout algorithms
produce good layouts. Unfortunately, for larger graphs, they often get stuck at local minima
and have high computational complexity. In this paper, we introduce a novel message
passing technique for graph layout. The key idea of our message passing technique is that
an aesthetic layout can be obtained if each node independently suggests aesthetic …