A new dissimilarity measure for comparing labeled graphs
type: Item
instance of: scholarly article
title: A new dissimilarity measure for comparing labeled graphs
zbMATH Open document ID: 1258.05076
author: Nicolas Wicker
author: Canh Hao Nguyen
author: Hiroshi Mamitsuka
published in: Linear Algebra and its Applications
publication date: 2013-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 6138416
zbMATH Keywords: labeled graph dissimilarity
zbMATH Keywords: spectral graph comparison
zbMATH Keywords: graph Laplacian
MaRDI profile type: Publication
full work available at URL: j.laa.2012.10.021
OpenAlex ID: W2008106405
cites work: Q3546377
cites work: A graph distance metric based on the maximal common subgraph
cites work: Q5691133
cites work: A graph distance measure for image analysis
cites work: A graph distance metric combining maximum common subgraph and minimum common supergraph
cites work: Q5528329
cites work: Spectral embedding of graphs.
cites work: A distance measure between attributed relational graphs for pattern recognition
cites work: Q4001837
cites work: Graph kernels
DOI: 10.1016/J.LAA.2012.10.021
Recommended article: Q5283715
Recommended article: Q3047588
Recommended article: Q5445046
Recommended article: On graphlike \(k\)-dissimilarity vectors
Recommended article: Q4496079
Recommended article: A comparative analysis of new graph distance measures and graph edit distance
Recommended article: A similarity measure for graphs with low computational complexity
description: scientific article; zbMATH DE number 6138416