We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Navigating Clustered Graphs Using Force-Directed Methods
PeriodicalsMathematics

Navigating Clustered Graphs Using Force-Directed Methods

Checking your access to this record.

Abstract & Overview

Graphs which arise in Information Visualization applications are typically very large: thousands, or perhaps millions of nodes. Current graph drawing methods successfully deal with (at best) a few hundred nodes. This paper describes a strategy for the visualization and navigation of graphs. The strategy has three elements: 1. A layered architecture, called CGA, for handling clustered graphs: these are graphs with a hierarchical node clustering superimposed. 2. An online force-directed graph drawing method. 3. Animation methods. Using this strategy, a user may view an abridgment of a graph, that is, a small part of the graph that is currently of interest. By changing the abridgment, the user may travel through the graph. The changes use animation to smoothly transform one view to the next. The strategy has been implemented in a prototype system called DA-TU. Communicated by G. Liotta and S. H. Whitesides: submitted September 1998; revised

Cite this record

Peter Eades, Mao Lin Huang (2000). Navigating Clustered Graphs Using Force-Directed Methods. Journal of Graph Algorithms and Applications, 4(3), 157–181. https://doi.org/10.7155/jgaa.00029

Copy in another style

Eades, P., & Huang, M. L. (2000). Navigating Clustered Graphs Using Force-Directed Methods. Journal of Graph Algorithms and Applications, 4(3), 157–181. https://doi.org/10.7155/jgaa.00029
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.