Mean and maximum common subgraph of two graphs
- 14 February 2000
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 21 (2) , 163-168
- https://doi.org/10.1016/s0167-8655(99)00143-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problemPattern Recognition Letters, 1999
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- A DIFFERENCE ALGORITHM FOR OCR-GENERATED TEXTSeries in Machine Perception and Artificial Intelligence, 1993
- Organization of Relational Models for Scene AnalysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Backtrack search algorithms and the maximal common subgraph problemSoftware: Practice and Experience, 1982
- The String-to-String Correction ProblemJournal of the ACM, 1974
- A note on the derivation of maximal common subgraphs of two directed or undirected graphsCalcolo, 1973