A new dissimilarity measure for comparing labeled graphs
From MaRDI portal
Publication:1938689
DOI10.1016/j.laa.2012.10.021zbMath1258.05076MaRDI 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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item