Graph distance using graph union

Pattern Recognition Letters

Volumn 22, Issue 6-7, 2001, Pages 701-704

  Wallis, W D ^a   Shoubridge, P ^b   Kraetz, M ^b   Ray, D ^c  

^a SOUTHERN ILLINOIS UNIVERSITY   (United States)

^b DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^c Department of Defense ^*  (United States)

Author keywords

Graph distance; Maximum common subgraph; Sugraph isomorphism

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; PROBLEM SOLVING;

GRAPH DISTANCE THEORY;

PATTERN MATCHING;

PATTERN RECOGNITION;

EID: 0035339347     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(01)00022-8     Document Type: Article

References (16)

1. On a relation between graph edit distance and maximum common subgraph
2. Recent advances in graph matching
3. A graph distance metric based on the maximal common subgraph
4. An efficient algorithm for graph isomorphism
5. Stereo correspondence through feature grouping and maximal cliques
6. Pattern associativity and the retrieval of semantic networks
7. Conceptual graph matching: A flexible algorithm and experiments
8. Graph theory and the study of activity structure
9. A distance measure between attributed relational graphs for pattern recognition
10. Models for evolving fixed node networks: Model fitting and model testing
11. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors
12. Detection of abnormal change in dynamic networks
13. Approaches to measuring network change
14. An algorithm for subgraph isomorphism
15. An eigendecomposition approach to weighted graph matching problems