A new dissimilarity measure for comparing labeled graphs

DOI10.1016/j.laa.2012.10.021zbMath1258.05076OpenAlexW2008106405MaRDI QIDQ1938689

Canh Hao Nguyen, Nicolas Wicker, Hiroshi Mamitsuka

Publication date: 22 February 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.10.021

zbMATH Keywords

graph Laplacianlabeled graph dissimilarityspectral graph comparison

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Comparing large-scale graphs based on quantum probability theory, Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral embedding of graphs.
• A graph distance measure for image analysis
• A graph distance metric based on the maximal common subgraph
• A distance measure between attributed relational graphs for pattern recognition
• A graph distance metric combining maximum common subgraph and minimum common supergraph