MyWork > Publications > Cluster Graph Embedding

Personal Note

The paper was published in the Proceedings of the ROGICS '08 Conference.

Abstract

Cluster graphs are a valuable concept to visualize structured relational information. Hierarchical cluster graphs impose 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. Clusters and cluster hierarchies respectively, can be dynamically closed or opened which is vital to selectively reduce the information presented by large graphs. In our case such an operation only rearranges the graph locally, therefore preserving the mental map of the user. We also present results achieved with our algorithm in the domain of semantic net exploration.

Download

PDF version of the paper
High resolution screenshot of the music graph from the paper