Tampere University of Technology

TUTCRIS Research Portal

Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

Research output: Contribution to journalArticleScientificpeer-review


Original languageEnglish
Pages (from-to)7-20
Number of pages14
JournalApplied Mathematics and Computation
Issue number1
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Publication typeA1 Journal article-refereed


In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity.


  • Complexity analysis, Graph classes, Graph classification, Graph similarity, Hierarchical models, Structured objects