Comparing large graphs efficiently by margins of feature vectors

DOI10.1016/j.amc.2006.11.185zbMath1120.68080OpenAlexW2168007630MaRDI QIDQ2372051

Frank Emmert-Streib, Matthias Dehmer

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

similarity measuresgraph similaritydirected and undirected graphsdegree vectors

Mathematics Subject Classification ID

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

Related Items (4)

A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees ⋮ Structure-based graph distance measures of high degree of precision ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs ⋮ Comparing large-scale graphs based on quantum probability theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the editing distance between unordered labeled trees
• Parallel concepts in graph theory
• On a certain distance between isomorphism classes of graphs
• An Algorithm for Subgraph Isomorphism
• Inexact graph matching for structural pattern recognition
• Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
• Inequalities: theory of majorization and its applications

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