Graph distances using graph union
- 1 May 2001
- journal article
- Published by Elsevier BV in Pattern Recognition Letters
- Vol. 22 (6-7), 701-704
- https://doi.org/10.1016/s0167-8655(01)00022-8
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Quantitative Measures of Change Based on Feature Organization: Eigenvalues and EigenvectorsComputer Vision and Image Understanding, 1998
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- Models for evolving fixed node networks: Model fitting and model testingSocial Networks, 1995
- Conceptual graph matching: a flexible algorithm and experimentsJournal of Experimental & Theoretical Artificial Intelligence, 1992
- Pattern associativity and the retrieval of semantic networksComputers & Mathematics with Applications, 1992
- Stereo correspondence through feature grouping and maximal cliquesIeee Transactions On Pattern Analysis and Machine Intelligence, 1989
- An eigendecomposition approach to weighted graph matching problemsIeee Transactions On Pattern Analysis and Machine Intelligence, 1988
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970