Hierarchical decompositions are a useful tool for drawing large graphs. Such decompositions can be represented by means of a data structure called hierarchy tree. In this paper we introduce the notion of P-validity of hierarchy trees with respect to a given property P: this notion reflects the similarity between the topological structure of the original graph and of any high-level representation of it obtained from the hierarchy tree. We study the P-validity when the clustered graph is a tree and property P is the acyclicity, presenting a structure theorem for the P-validity of hierarchy trees under these hypotheses.
Finocchi, Irene; Petreschi, Rossella. (2001). On the validity of hierarchical decompositions. In 7th Annual International Computing and Combinatorics Conference (COCOON'01) (pp. 368- 374). Isbn: 9783540424949. Doi: 10.1007/3-540-44679-6_40.
On the validity of hierarchical decompositions
Irene Finocchi;
2001
Abstract
Hierarchical decompositions are a useful tool for drawing large graphs. Such decompositions can be represented by means of a data structure called hierarchy tree. In this paper we introduce the notion of P-validity of hierarchy trees with respect to a given property P: this notion reflects the similarity between the topological structure of the original graph and of any high-level representation of it obtained from the hierarchy tree. We study the P-validity when the clustered graph is a tree and property P is the acyclicity, presenting a structure theorem for the P-validity of hierarchy trees under these hypotheses.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
