Graph similarity scoring and matching
From MaRDI portal
Publication:2472827
Recommendations
- On the use of similarity metrics for approximate graph matching
- Using local similarity measures to efficiently address approximate graph matching
- A new method of measuring similarity for a special class of directed graphs
- Distance patterns in structural similarity
- A similarity measure for graphs with low computational complexity
Cites work
- A graph distance metric combining maximum common subgraph and minimum common supergraph
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- An Algorithm for Subgraph Isomorphism
- An eigendecomposition approach to weighted graph matching problems
- Authoritative sources in a hyperlinked environment
- Caps and Robbers: What Can You Expect?
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
Cited in
(24)- Similarity matrices for colored graphs
- Graph nodes and a definition of structural similarity
- Tracking network dynamics: a survey using graph distances
- A method for agent-based models validation
- Estimating a graphical intra-class correlation coefficient (GICC) using multivariate probit-linear mixed models
- Cost and accuracy aware scientific workflow retrieval based on distance measure
- Fifty years of graph matching, network alignment and network comparison
- Dynamic Katz and related network measures
- On efficient network similarity measures
- Comparing large graphs efficiently by margins of feature vectors
- Efficient identifications of structural similarities for graphs
- On the use of similarity metrics for approximate graph matching
- scientific article; zbMATH DE number 4039703 (Why is no real title available?)
- Similarity in languages and programs
- Graph unification and matching
- Graph similarity through entropic manifold alignment
- Using local similarity measures to efficiently address approximate graph matching
- Toward quantifying vertex similarity in networks
- Beyond non-backtracking: non-cycling network centrality measures
- Graph-Based Representations in Pattern Recognition
- Generalised heat kernel invariants of a graph and application to object clustering
- Defective eigenvalues of the non-backtracking matrix
- Graph matching based on similarities in structure and attributes
- Quantitative graph theory: a new branch of graph theory and network science
This page was built for publication: Graph similarity scoring and matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472827)
