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.
ASJC Scopus subject areas
- Applied Mathematics
- Computational Mathematics
- Numerical Analysis
Dehmer, M., & Emmert-Streib, F. (2007). Structural similarity of directed universal hierarchical graphs: A low computational complexity approach. Applied Mathematics and Computation, 194(1), 7-20. https://doi.org/10.1016/j.amc.2007.04.006