A Multi-Graph Approach to Complexity Management in Interactive Graph Visualization

Dogrusoz, U and Genc, B (2006) A Multi-Graph Approach to Complexity Management in Interactive Graph Visualization. [Journal (Paginated)]

Full text not available from this repository.

Abstract

In this paper we describe a new, multi-graph approach for development of a comprehensive set of complexity management techniques for interactive graph visualization tools. This framework facilitates efficient implementation of management of multiple associated graphs with navigation links and nesting of graphs as well as ghosting, folding and hiding of unwanted graph elements. The theoretical analyses show that the involved data structures and operations on them are quite efficient, and an implementation in a graph drawing tool has proven to be successful.

Item Type:Journal (Paginated)
Additional Information:10.1016/j.cag.2005.10.015
Keywords:Complexity management; Compound graph; Software engineering
Classifications:S Software and Systems > S.001 General
M Methods > M.999 Others
ID Code:740

Repository Staff Only: item control page

References

Di Battista G, Eades P, Tamassia R, Tollis IG. Graph drawing, algorithms for the visualization of graphs. Englewood Cliffs (NJ): Prentice-Hall; 1999.

Dogrusoz U, Feng Q, Madden B, Doorley M, Frick A. Graph visualization toolkits. IEEE Computer Graphics and Applications 2002;22(1):30–7.

Sugiyama K, Misue K. Visualization of structural information: automatic drawing of compound digraphs. IEEE Transactions on Systems Man and Cybernetics 1991;21(4): 876–92.

Fukuda K, Takagi T. Knowledge representation of signal transduction pathways. Bioinformatics 2001;17(9):829–37.

Eades P, Feng Q. Multilevel visualization of clustered graphs. In: North S, editor. Graph drawing, Proceedings of the GD ’96, Lecture notes in computer science, vol. 1190. Berlin: Springer; 1997. p. 101–12.

Harel D. On visual formalisms. Communications of the ACM 1988;31(5):514–30.

Brockenauer R, Cornelsen S. Drawing graphs: methods and models. New York: Springer; 2001.

Duncan C, Goodrich M, Kobourov S. Balanced aspect ratio trees and their use for drawing very large graphs. In: Whitesides S, editor. Graph drawing, Proceedings of the GD ’98, Lecture notes in computer science, vol. 1547. Berlin: Springer; 1998, p. 111–24.

Raitner M. HGV: a library for hierarchies, graphs and views. In: Goodrich SKMT, editor. Graph drawing,Proceedings of the GD ’02, Lecture notes in computer science, vol. 2528. Berlin: Springer; 2002. p. 236–43.

Lai W, Eades P. A graph model which supports flexible layout functions, Technical Report 96-15, Callaghan 2308, Australia; 1996, oURL citeseer.nj.nec.com/189844.html4.

Sarkar M, Brown MH. Graphical fisheye views of graphs. In: Bauersfeld P, Bennett J, Lynch G, editors. Human factors in computing systems, CHI’92 conference proceedings: striking a balance. New York: ACM Press; 1992. p. 83–91.

Sarkar M, Brown MH. Graphical fisheye views. Communications of the ACM 1994;37(12):73–84.

Buchsbaum AL, Westbrook JR. Maintaining hierarchical graph views. In: Proceedings of the 11th annual ACM–SIAM symposium on discrete algorithms. New York:ACM Press; 2000. p. 566–75.

Buchsbaum AL, Goodrich MT, Westbrook J. Range searching over tree cross products. In: European symposium on algorithms, 2000. p. 120–31,URL: citeseer.nj.nec.com/buchsbaum00range.html4.

Herman I, Melancon G, Marshall MS. Graph visualization and navigation in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics 2000;6(1):24–43.

Sander G. Graph layout through the VCG tool. In: Tamassia R, Tollis I, editors. Graph drawing, Proceedings of the GD ’94, Lecture notes in computer science, vol. 894. Berlin: Springer; 1995. p. 194–295.

Sugiyama K, Misue K. A generic compound graph visualizer/manipulator: D-ABDUCTOR. In: Brandenburg FJ, editor. Graph drawing, Proceedings of the GD ’95, Lecture notes in computer science, vol. 1027. Berlin: Springer; 1995. p. 500–3.

Lisitsyn IA, Kasyanov VN. Higres—visualization system for clustered graphs and graph algorithms. In: Kratochvíl J, editor. Graph drawing, Proceedings of the GD ’99, Lecture notes in computer science, vol. 1731. Berlin: Springer; 1999. p. 82–9.

Huang M, Eades P. A fully animated interactive system for clustering and navigating huge graphs. In: Whitesides S, editor. Graph drawing, Proceedings of the GD ’98, Lecture notes in computer science, vol. 1547. Berlin: Springer; 1998. p. 376–83.