Treemaps for Directed Acyclic Graphs

Tsiaras, Vassilis and Triantafilou, Sofia and Tollis, Ioannis G. (2008) Treemaps for Directed Acyclic Graphs. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 377-388(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_37).

Full text not available from this repository.

Abstract

Gene Ontology information related to the biological role of genes is organized in a hierarchical manner that can be represented by a directed acyclic graph (DAG). Treemaps graphically represent hierarchical information via a two-dimensional rectangular map. They efficiently display large trees in limited screen space. Treemaps have been used to visualize the Gene Ontology by first transforming the DAG into a tree. However this transformation has several undesirable effects such as producing trees with a large number of nodes and scattering the rectangles associated with the duplicates of a node around the screen. In this paper we introduce the problem of visualizing a DAG as a treemap, we present two special cases, and we discuss complexity results.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-77537-9_37
Classifications: P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/853

Actions (login required)

View Item View Item