CluE: An algorithm for expanding clustered graphs

IEEE Pacific Visualization Symposium

Volumn , Issue , 2014, Pages 233-237

  Altarawneh, Ragaad ^a   Schultz, Johannes ^a   Humayoun, Shah Rukh ^a  

^a University of Koblenz Landau   (Germany)

Author keywords

clustered graphs exploration; compound graphs visualization; graphs and networks; Information visualization

Indexed keywords

INFORMATION SYSTEMS; VISUALIZATION;

CLUSTERED GRAPH; COMPOUND GRAPHS; GRAPHS AND NETWORKS; INFORMATION VISUALIZATION; LAYOUT ALGORITHMS; ORTHOGONAL LAYOUT; UNDERLYING GRAPHS; USERS' ACCEPTANCE;

CLUSTERING ALGORITHMS;

EID: 84899562293     PISSN: 21658765     EISSN: 21658773     Source Type: Conference Proceeding    
DOI: 10.1109/PacificVis.2014.18     Document Type: Conference Paper

References (19)

1. J. Abello, F. van Ham, and N. Krishnan. Ask-graphview: A large scale graph visualization system. IEEE Transactions on Visualization and Computer Graphics, 12(5):669-676, 2006.
2. D. Archambault, T. Munzner, and D. Auber. Topolayout: Multilevel graph layout by topological features. IEEE Transactions on Visualization and Computer Graphics, 13:305-317, 2007.
3. D. Archambault, T. Munzner, and D. Auber. Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics, 14(4):900-913, July 2008.
4. M. Bozzano and A. Villafiorita. Design and Safety Assessment of Critical Systems. CRC Press (Taylor and Francis), an Auerbach Book, 2010.
5. P. Eades and M. L. Huang. Navigating clustered graphs using forcedirected methods. Journal of Graph Algorithms and Applications, 4:157-181, 2000.
6. Q.-W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In ESA, pages 213-226, 1995.
7. I. M.-A. Fuhrmann. Layout of compound graphs. Diploma thesis from Department of Computer Science Real-Time and Embedded Systems Group, Christian-Albrechts-Universitt zu Kiel, 2012.
8. N. Gelfand and R. Tamassia. Algorithmic patterns for orthogonal graph drawing. In S. Whitesides, editor, Graph Drawing, volume 1547 of Lecture Notes in Computer Science, pages 138-152. Springer, 1998.
9. C. Helen, Purchase, E. Hoggan, and C. Gorg. How Important Is the Mental Map? An Empirical Investigation of a Dynamic Graph Layout Algorithm, volume 4372/2007, pages 184-195. Springer Berlin / Heidelberg, 2007.
10. D. Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graph., 12(5):741-748, 2006.
11. M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs, 1998. 10.1007/3-540-37623-2 29.
12. B. Kaiser, C. Gramlich, and M. Forster. State/event fault treesa safety analysis model for software-controlled systems. Reliability Engineering System Safety, 92(11):1521-1537, 2007.
13. B. Kaiser, P. Liggesmeyer, and O. Mckel. A new component concept for fault trees. Reproduction, 33:37-46, 2003.
14. J. Katreniakova. Mental map preserving cluster expansion. In SOFSEM (2), pages 58-69, 2008.
15. E. A. Lee and S. A. Seshia. Introduction to Embedded Systems-A Cyber-Physical Systems Approach. Lee and Seshia, 1 edition, 2010.
16. M. Raitner. Visual navigation of compound graphs. In J. Pach, editor, Graph Drawing, volume 3383 of Lecture Notes in Computer Science, pages 403-413. Springer Berlin Heidelberg, 2005.
17. E. M. Reingold and S. Tilford. Tidier drawing of trees. IEEE Trans. Software Eng, 1981.
18. K. Sugiyama and K. Misue. Visualization of structural information: automatic drawing of compound digraphs. Systems, Man and Cybernetics, IEEE Transactions on, 21(4):876-892, 1991.
19. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. Ieee Transactions On Systems Man And Cybernetics, 11(2):109-125, 1981.