Dear guest, welcome to this publication database. As an anonymous user, you will probably not have edit rights. Also, the collapse status of the topic tree will not be persistent. If you like to have these and other options enabled, you might ask Pascal Held for a login account.
This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit www.aigaion.nl. SourceForge.hetLogo
 [BibTeX] [RIS]
Cluster-based Visualization of Dynamic Graphs
Type of publication: Inproceedings
Citation:
Booktitle: Proceedings. 23. Workshop Computational Intelligence, Dortmund, 5. - 6. Dezember 2013
Series: Schriftenreihe des Instituts für Angewandte Informatik - Automatisierungstechnik, Karlsruher Institut für Technologie
Volume: 46
Year: 2013
Month: December
Pages: 21-37
Publisher: KIT Scientific Publishing
Address: Karlsruhe
ISSN: 1614-5267
ISBN: 978-3-7315-0126-8
URL: http://digbib.ubka.uni-karlsru...
DOI: 10.5445/KSP/1000036887
Abstract: Graph visualizations are applied for describing relations between objects in many application fields, e.g., in social network analysis and software visualization. Several clustering strategies can be used to identify groups of objects automatically. On the one hand, visualizing these clusters is useful to analyze and evaluate clustering algorithms. On the other hand, cluster visualization allows a fast estimation of similarity between objects and provides orientation in the graph. Because objects, relations and clusters might change over time, dynamic graph drawing received significant interest in the last decades. Several algorithms have been proposed enhancing well-known static layout algorithms. However the dynamic drawing of clusters in graphs is less considered. In this work, we propose three layout algorithms for dynamic clustered graphs. While two approaches are based on enhancing a force-directed layout, the third one uses a divide-and-conquer approach. The approaches are evaluated and compared based on different metrics. The results suggest that the divide-and-conquer approach is best suited for the dynamic drawing of clustered graphs since it separates the clusters well and stabilizes the layout.
Keywords:
Authors Held, Pascal
Hempel, Julia
Kruse, Rudolf
Editors Hoffmann, Frank
Hüllermeier, Eyke
Added by: []
Total mark: 0
Attachments
  • 978-3-7315-0126-8-held.pdf
Notes
    Topics