05665845

j

05665845 Gansner, Emden Hu, Yifan Efficient, proximity-preserving node overlap removal. J. Graph Algorithms Appl. 14, No. 1, 53-74 (2010). 2010 Brown University, Providence, RI; University of Texas, Dallas, TX EN drawing graphs

http://www.cs.brown.edu/sites/jgaa/volume14.html

Summary: When drawing graphs whose nodes contain text or graphics, the non- trivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while minimizing the additional area required. This paper presents a new node overlap removal algorithm that does well at retaining a graph's shape while using little additional area and time. As part of the analysis, we consider and evaluate two measures of dissimilarity for two layouts of the same graph.