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

M. Dehmer; Frank Emmert-Streib

doi:10.1016/j.amc.2007.04.006

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

M. Dehmer, Frank Emmert-Streib

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	7-20
Number of pages	14
Journal	Applied Mathematics and Computation
Volume	194
Issue number	1
DOIs	https://doi.org/10.1016/j.amc.2007.04.006
Publication status	Published - 01 Dec 2007

ASJC Scopus subject areas

Applied Mathematics
Computational Mathematics
Numerical Analysis

Access to Document

10.1016/j.amc.2007.04.006

Cite this

@article{121287d23c5e4d199aba3c0f54e4b4c1,

title = "Structural similarity of directed universal hierarchical graphs: A low computational complexity approach",

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.",

author = "M. Dehmer and Frank Emmert-Streib",

year = "2007",

month = dec,

day = "1",

doi = "10.1016/j.amc.2007.04.006",

language = "English",

volume = "194",

pages = "7--20",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

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

AU - Dehmer, M.

AU - Emmert-Streib, Frank

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

U2 - 10.1016/j.amc.2007.04.006

DO - 10.1016/j.amc.2007.04.006

M3 - Article

SN - 0096-3003

VL - 194

SP - 7

EP - 20

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 1

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this