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

DOI10.1016/J.AMC.2007.04.006MaRDI QIDQ990638zbMATH OpenOpenAlexFDO

Authors Matthias Dehmer, Frank Emmert-Streib

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 analysisgraph classesgraph classificationgraph similarityhierarchical modelsstructured objects

Mathematics Subject Classification ID

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

Recommendations

• A similarity measure for graphs with low computational complexity
• A new method of measuring similarity for a special class of directed graphs
• scientific article; zbMATH DE number 2038751
• Comparing large graphs efficiently by margins of feature vectors
• Two approaches to determining similarity of two digraphs

Cites work

• A new method of measuring similarity for a special class of directed graphs
• A similarity measure for graphs with low computational complexity
• Evolution of the social network of scientific collaborations
• Graph Classes: A Survey
• Graph theory applications
• scientific article; zbMATH DE number 4039703 (Why is no real title available?)
• scientific article; zbMATH DE number 3781233 (Why is no real title available?)
• scientific article; zbMATH DE number 42695 (Why is no real title available?)
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• Information theoretic measures of UHG graphs with low computational complexity
• On a certain distance between isomorphism classes of graphs
• On Computing the Critical Coupling Coefficient for the Kuramoto Model on a Complete Bipartite Graph
• Topological mappings between graphs, trees and generalized trees

Cited in

(11)

• 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
• Comparing large graphs efficiently by margins of feature vectors
• A hierarchical network model for epidemic spreading. analysis of A/H1N1 virus spreading in Romania
• Two approaches to determining similarity of two digraphs
• Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies
• A new method of measuring similarity for a special class of directed graphs
• Aspects on the optimal decoupling point setting problem
• Quantitative graph theory: a new branch of graph theory and network science
• A similarity measure for graphs with low computational complexity
• Structure-based graph distance measures of high degree of precision

Describes a project that uses

Uses Software

• Dynagraph
• Graphviz

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990638)