A Framework for Complexity Management in Graph Visualization

Dogrusoz, Ugur and Genc, Burkay (2002) A Framework for Complexity Management in Graph Visualization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 368-369(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_37).

Full text not available from this repository.

Abstract

We present a comprehensive framework for development of complexity management techniques in graph visualization tools. The presented architecture is capable of managing 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 algorithms are quite efficient, and an implementation in a graph drawing tool has proven to be successful. Our architecture is based on dynamic interactive compound graphs. The definition of compound graphs is extended to efficiently handle the graph editing and complexity management operations. A navigation forest is used to keep track of navigational links among nodes and graphs, and a nesting forest is used to keep track of nesting (inclusion) relations.

Item Type:	Conference Paper
Additional Information:	10.1007/3-540-36151-0_37
Classifications:	M Methods > M.999 Others M Methods > M.300 Dynamic / Incremental / Online S Software and Systems > S.999 Others P Styles > P.240 Compound P Styles > P.999 Others
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/349

Actions (login required)

View Item