Some properties of a dissimilarity measure for labeled graphs
From MaRDI portal
Publication:5283715
zbMATH Open1408.05085MaRDI QIDQ5283715FDOQ5283715
Authors: Nicolas Wicker, Canh Hao Nguyen, Hiroshi Mamitsuka 
Publication date: 24 July 2017
Full work available at URL: http://pmb.cedram.org/item?id=PMB_2016____85_0
Recommendations
- A new dissimilarity measure for comparing labeled graphs
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks
- Subgraphs as a measure of similarity
- Comparing large graphs efficiently by margins of feature vectors
- scientific article; zbMATH DE number 1489856
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cited In (5)
- A new dissimilarity measure for comparing labeled graphs
- Classifying Inconsistency Measures Using Graphs
- A measure of dissimilarity between diffusive processes on networks
- Properties of graph distance measures by means of discrete inequalities
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks
This page was built for publication: Some properties of a dissimilarity measure for labeled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283715)
