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

M. Dehmer, Frank Emmert-Streib

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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. (c) 2007 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)7-20
Number of pages14
JournalApplied Mathematics and Computation
Volume194
Issue number1
DOIs
Publication statusPublished - 01 Dec 2007

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Numerical Analysis

Fingerprint Dive into the research topics of 'Structural similarity of directed universal hierarchical graphs: A low computational complexity approach'. Together they form a unique fingerprint.

  • Cite this