Graph similarity scoring and matching
From MaRDI portal
Publication:2472827
DOI10.1016/j.aml.2007.01.006zbMath1131.05091OpenAlexW2027264060MaRDI QIDQ2472827
George C. Verghese, Laura A. Zager
Publication date: 25 February 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.01.006
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
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, Similarity in languages and programs, Efficient identifications of structural similarities for graphs, Cost and accuracy aware scientific workflow retrieval based on distance measure, Fifty years of graph matching, network alignment and network comparison, Beyond non-backtracking: non-cycling network centrality measures, Toward Quantifying Vertex Similarity in Networks, Quantitative graph theory: a new branch of graph theory and network science, Dynamic Katz and related network measures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Authoritative sources in a hyperlinked environment
- An eigendecomposition approach to weighted graph matching problems
- An Algorithm for Subgraph Isomorphism
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- A graph distance metric combining maximum common subgraph and minimum common supergraph
- Caps and Robbers: What Can You Expect?