Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
DOI10.1016/J.AMC.2007.04.006zbMATH Open1193.68188OpenAlexW2036778122MaRDI QIDQ990638FDOQ990638
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
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
hierarchical modelsgraph classescomplexity analysisgraph similaritygraph classificationstructured objects
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Evolution of the social network of scientific collaborations
- Graph Classes: A Survey
- Information theoretic measures of UHG graphs with low computational complexity
- Title not available (Why is that?)
- On a certain distance between isomorphism classes of graphs
- On Computing the Critical Coupling Coefficient for the Kuramoto Model on a Complete Bipartite Graph
- Title not available (Why is that?)
- Graph theory applications
- A similarity measure for graphs with low computational complexity
- Title not available (Why is that?)
- Topological mappings between graphs, trees and generalized trees
- Title not available (Why is that?)
- A new method of measuring similarity for a special class of directed graphs
Cited In (10)
- Two approaches to determining similarity of two digraphs
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
- Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies
- Quantitative graph theory: a new branch of graph theory and network science
- A similarity measure for graphs with low computational complexity
- A hierarchical network model for epidemic spreading. analysis of A/H1N1 virus spreading in Romania
- Counterexamples to conjectures on graph distance measures based on topological indexes
- A new method of measuring similarity for a special class of directed graphs
- Structure-based graph distance measures of high degree of precision
- Comparing large graphs efficiently by margins of feature vectors
Uses Software
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)
