Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method
From MaRDI portal
Publication:4600527
DOI10.1142/S0218488516500215zbMATH Open1377.68182WikidataQ114822737 ScholiaQ114822737MaRDI QIDQ4600527FDOQ4600527
Authors: David F. Nettleton, J. Salas 
Publication date: 11 January 2018
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Recommendations
- Algorithms for approximate graph matching
- Bipartite Graph Matching for Computing the Edit Distance of Graphs
- Using local similarity measures to efficiently address approximate graph matching
- On the use of similarity metrics for approximate graph matching
- Node matching computation between two large graphs in linear computational cost
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Algorithms on strings (68W32)
This page was built for publication: Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600527)
