Graph distances using graph union
From MaRDI portal
Publication:4795068
DOI10.1016/S0167-8655(01)00022-8zbMath1010.68896OpenAlexW2046509566WikidataQ127006053 ScholiaQ127006053MaRDI QIDQ4795068
No author found.
Publication date: 20 February 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(01)00022-8
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)
Related Items (10)
Data mining for DNA viruses with breast cancer, fibroadenoma, and normal mammary tissue ⋮ Metric for Comparison of Graph-Theoretic Models of the Same Dimension with Ordered Vertices ⋮ Automatic learning of cost functions for graph edit distance ⋮ Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ Applying correlation dimension to the analysis of the evolution of network structure ⋮ Structure-based graph distance measures of high degree of precision ⋮ Network comparison and the within-ensemble graph distance ⋮ A distance measure for large graphs based on prime graphs ⋮ Deep graph similarity learning: a survey ⋮ Weak and directional monotonicity of functions on Riesz spaces to fuse uncertain data
This page was built for publication: Graph distances using graph union
