Navigating clustered graphs using force-directed methods.

Eades, Peter; Huang, Lin Mao

Journal of Graph Algorithms and Applications (2000)

  • Volume: 4, Issue: 3, page 157-181
  • ISSN: 1526-1719

How to cite

top

Eades, Peter, and Huang, Lin Mao. "Navigating clustered graphs using force-directed methods.." Journal of Graph Algorithms and Applications 4.3 (2000): 157-181. <http://eudml.org/doc/48613>.

@article{Eades2000,
author = {Eades, Peter, Huang, Lin Mao},
journal = {Journal of Graph Algorithms and Applications},
keywords = {information visualization; clustered graphs},
language = {eng},
number = {3},
pages = {157-181},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Navigating clustered graphs using force-directed methods.},
url = {http://eudml.org/doc/48613},
volume = {4},
year = {2000},
}

TY - JOUR
AU - Eades, Peter
AU - Huang, Lin Mao
TI - Navigating clustered graphs using force-directed methods.
JO - Journal of Graph Algorithms and Applications
PY - 2000
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 4
IS - 3
SP - 157
EP - 181
LA - eng
KW - information visualization; clustered graphs
UR - http://eudml.org/doc/48613
ER -

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.