Efficient, proximity-preserving node overlap removal.
Journal of Graph Algorithms and Applications (2010)
- Volume: 14, Issue: 1, page 53-74
- ISSN: 1526-1719
Access Full Article
top
How to cite
topGansner, Emden, and Hu, Yifan. "Efficient, proximity-preserving node overlap removal.." Journal of Graph Algorithms and Applications 14.1 (2010): 53-74. <http://eudml.org/doc/231584>.
@article{Gansner2010,
author = {Gansner, Emden, Hu, Yifan},
journal = {Journal of Graph Algorithms and Applications},
keywords = {drawing graphs},
language = {eng},
number = {1},
pages = {53-74},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Efficient, proximity-preserving node overlap removal.},
url = {http://eudml.org/doc/231584},
volume = {14},
year = {2010},
}
TY - JOUR
AU - Gansner, Emden
AU - Hu, Yifan
TI - Efficient, proximity-preserving node overlap removal.
JO - Journal of Graph Algorithms and Applications
PY - 2010
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 14
IS - 1
SP - 53
EP - 74
LA - eng
KW - drawing graphs
UR - http://eudml.org/doc/231584
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.