Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
type: Item
instance of: scholarly article
title: Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
zbMATH Open document ID: 1193.68188
author: Matthias Dehmer
author: Frank Emmert-Streib
published in: Applied Mathematics and Computation
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5777098
zbMATH Keywords: structured objects
zbMATH Keywords: hierarchical models
zbMATH Keywords: graph classes
zbMATH Keywords: graph classification
zbMATH Keywords: graph similarity
zbMATH Keywords: complexity analysis
describes a project that uses: Dynagraph
describes a project that uses: Graphviz
MaRDI profile type: Publication
full work available at URL: j.amc.2007.04.006
OpenAlex ID: W2036778122
cites work: Evolution of the social network of scientific collaborations
cites work: Graph Classes: A Survey
cites work: Q5445046
cites work: A similarity measure for graphs with low computational complexity
cites work: Graph theory applications
cites work: Information theoretic measures of UHG graphs with low computational complexity
cites work: Topological mappings between graphs, trees and generalized trees
cites work: Q3992521
cites work: Q5515142
cites work: Q4039929
cites work: On Computing the Critical Coupling Coefficient for the Kuramoto Model on a Complete Bipartite Graph
cites work: Q3778584
cites work: Q3960889
cites work: On a certain distance between isomorphism classes of graphs
DOI: 10.1016/J.AMC.2007.04.006
description: scientific article; zbMATH DE number 5777098