Force directed embedding of hierarchical cluster graphs

Research output: Contribution to conferencePaperAcademic

Abstract

Cluster graphs are a valuable concept to visualize structu-red relational information. Hierarchical cluster graphs im-pose further levels of granularity which may be controlled by the user. In this paper we present a force directed layout adjustment algorithm for hierarchical cluster graphs. Clus-ters and cluster hierarchies respectively, can be dynamically closed or opened which is vital to selectively reduce the in-formation presented by large graphs. In our case such an operation only rearranges the graph locally, therefore pre-serving the mental map of the user. We also present results achieved with our algorithm in the domain of semantic net exploration.
Original languageEnglish
Number of pages7
Publication statusPublished - 2008
Externally publishedYes
EventInternational Conference on ROGICS - Mahdia, Tunisia
Duration: 12 May 200815 May 2008

Conference

ConferenceInternational Conference on ROGICS
Country/TerritoryTunisia
CityMahdia
Period12/05/0815/05/08

Keywords

  • graph drawing
  • force directed layout
  • cluster graph
  • meta-graph
  • layout adjustment

Fingerprint

Dive into the research topics of 'Force directed embedding of hierarchical cluster graphs'. Together they form a unique fingerprint.

Cite this