Efficient, proximity-preserving node overlap removal.

Gansner, Emden; Hu, Yifan

Journal of Graph Algorithms and Applications, Tome 14 (2010), p. 53-74 / Harvested from The Electronic Library of Mathematics

Access to full text
Full (PDF)

Publié le : 2010-01-01

Zbl 1185.68778

EUDML-ID : urn:eudml:doc:231584

@article{05665845,
     title = {Efficient, proximity-preserving node overlap removal.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {14},
     year = {2010},
     pages = {53-74},
     zbl = {1185.68778},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05665845}
}

Gansner, Emden; Hu, Yifan. Efficient, proximity-preserving node overlap removal.. Journal of Graph Algorithms and Applications, Tome 14 (2010) pp. 53-74. http://gdmltest.u-ga.fr/item/05665845/