A Scalable Algorithm for Adjusting Node-Node Overlaps

The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynamic drawing, have been a problem in graph visualization. Several approaches have recently been proposed to solve such a problem. These approaches, however, lack the scalabilities of dealing with large number of overlapping nodes. Providing a formal description of the problem, this paper presents a scalable version of our previous approach called the force-transfer algorithm. Compared to other methods, our new algorithm is able to achieve the compact adjusted layout of a large graph