Structure-based graph distance measures of high degree of precision

DOI10.1016/j.patcog.2008.06.008zbMath1154.68456OpenAlexW1969101106MaRDI QIDQ947972

Yanghua Xiao, Hua Dong, Momiao Xiong, Baile Shi, Wei Wang, Wentao Wu

Publication date: 8 October 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.06.008

zbMATH Keywords

graph distancedistance metricSNP linkage disequilibriumstructure-based graph distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (2)

Applying correlation dimension to the analysis of the evolution of network structure ⋮ A distance measure for large graphs based on prime graphs

Cites Work

• Unnamed Item
• A similarity measure for graphs with low computational complexity
• Automatic learning of cost functions for graph edit distance
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• Comparing large graphs efficiently by margins of feature vectors
• A graph distance metric based on the maximal common subgraph
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• Graph distances using graph union
• A graph distance metric combining maximum common subgraph and minimum common supergraph
• Learning Theory and Kernel Machines
• Bipartite Graph Matching for Computing the Edit Distance of Graphs

This page was built for publication: Structure-based graph distance measures of high degree of precision