A new algorithm for removing node overlapping in graph visualization

Xiaodi Huang, W Lei, A.S.M Sajeev, Junbin Gao

Research output: Contribution to journalArticlepeer-review

39 Citations (Scopus)
155 Downloads (Pure)


Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, particularly in dynamic graph visualization. Providing a formal description of this problem, this paper presents a new approach called the Force-Transfer algorithm that removes node overlaps. Compared to other methods, our algorithm is usually able to achieve a compact adjusted layout within a reasonable running time.
Original languageEnglish
Pages (from-to)2821-2844
Number of pages24
JournalInformation Sciences
Issue number14
Publication statusPublished - 2007


Dive into the research topics of 'A new algorithm for removing node overlapping in graph visualization'. Together they form a unique fingerprint.

Cite this