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

DOI10.1016/j.amc.2007.04.006zbMath1193.68188OpenAlexW2036778122MaRDI QIDQ990638

Frank Emmert-Streib, Matthias Dehmer

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.006

zbMATH Keywords

complexity analysishierarchical modelsgraph classesgraph similaritygraph classificationstructured objects

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

A hierarchical network model for epidemic spreading. analysis of A/H1N1 virus spreading in Romania ⋮ A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees ⋮ Counterexamples to conjectures on graph distance measures based on topological indexes ⋮ Structure-based graph distance measures of high degree of precision ⋮ Quantitative graph theory: a new branch of graph theory and network science

Uses Software

• Graphviz
• Dynagraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A similarity measure for graphs with low computational complexity
• Topological mappings between graphs, trees and generalized trees
• Graph theory applications
• Evolution of the social network of scientific collaborations
• Information theoretic measures of UHG graphs with low computational complexity
• On Computing the Critical Coupling Coefficient for the Kuramoto Model on a Complete Bipartite Graph
• On a certain distance between isomorphism classes of graphs
• Graph Classes: A Survey

This page was built for publication: Structural similarity of directed universal hierarchical graphs: a low computational complexity approach