Comparing large graphs efficiently by margins of feature vectors

DOI10.1016/J.AMC.2006.11.185MaRDI QIDQ2372051zbMATH OpenOpenAlexFDO

Authors Matthias Dehmer, Frank Emmert-Streib

Publication date 10 July 2007

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

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

zbMATH Keywords

degree vectorsdirected and undirected graphsgraph similaritysimilarity measures

Mathematics Subject Classification ID

Distance in graphs (05C12) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• A new method of measuring similarity for a special class of directed graphs
• A similarity measure for graphs with low computational complexity
• Subgraphs as a measure of similarity
• Graph similarity scoring and matching

Cites work

• An Algorithm for Subgraph Isomorphism
• scientific article; zbMATH DE number 2089760 (Why is no real title available?)
• scientific article; zbMATH DE number 3907592 (Why is no real title available?)
• scientific article; zbMATH DE number 3966099 (Why is no real title available?)
• scientific article; zbMATH DE number 3703996 (Why is no real title available?)
• scientific article; zbMATH DE number 3781233 (Why is no real title available?)
• scientific article; zbMATH DE number 3639162 (Why is no real title available?)
• Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
• Inequalities: theory of majorization and its applications
• Inexact graph matching for structural pattern recognition
• On a certain distance between isomorphism classes of graphs
• On the editing distance between unordered labeled trees
• Parallel concepts in graph theory

Cited in

(13)

• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
• Comparing large-scale graphs based on quantum probability theory
• A comparative analysis of multidimensional features of objects resembling sets of graphs
• scientific article; zbMATH DE number 4039703 (Why is no real title available?)
• A Scalable Unsupervised Framework for Comparing Graph Embeddings
• Some properties of a dissimilarity measure for labeled graphs
• A distance measure for large graphs based on prime graphs
• A new method of measuring similarity for a special class of directed graphs
• Efficient graph similarity assessment method based on vectors of topological indices
• A distribution-based framework for network similarity assessment
• A similarity measure for graphs with low computational complexity
• Structure-based graph distance measures of high degree of precision
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach

This page was built for publication: Comparing large graphs efficiently by margins of feature vectors

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