Graph similarity scoring and matching

Applied Mathematics Letters

Volumn 21, Issue 1, 2008, Pages 86-94

  Zager, Laura A ^a   Verghese, George C ^a  

^a USA   (United States)

Author keywords

Graph algorithms; Graph alignment; Graph matching; Graphs and networks; Similarity measures

Indexed keywords

EDGE DETECTION; LINEAR SYSTEMS; PATTERN MATCHING;

GRAPH ALGORITHMS; GRAPH ALIGNMENTS; GRAPH MATCHING; SIMILARITY MEASURES;

GRAPH THEORY;

EID: 36248998189     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2007.01.006     Document Type: Article

References (19)

1. Ullman J.R. An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23 1 (1976) 31-42
2. Pelillo M. Replicator equations, maximum cliques and graph isomorphism. Neural Comput. 11 8 (1999) 1933-1955
3. Bunke H. Error correcting graph matching: on the influence of the underlying cost function. IEEE Trans. Pattern Anal. Mach. Intell. 21 (1999) 917-922
4. Fernandez M.L., and Valiente G. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognit. Lett. 22 (2001) 753-758
5. Pelillo M. Matching free trees, maximal cliques and monotone game dynamics. IEEE Trans. Pattern Anal. Mach. Intell. 24 (2002) 1535-1541
6. Kleinberg J.M. Authoritative sources in a hyperlinked environment. J. ACM 46 (1999) 614-632
7. S. Melnik, H. Garcia-Molina, A. Rahm, Similarity flooding: a versatile graph matching algorithm and its application to schema matching, in: Proceedings of the 18th International Conference on Data Engineering, San Jose, 2002
8. G. Jeh, J. Widom, SimRank: A measure of structural-context similarity, in: Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining, Edmonton, 2002
9. Heymans M., and Singh A. Deriving phylogenetic trees from the similarity analysis of metabolic pathways. Bioinformatics 19 Suppl. 1 (2003) 138-146
10. Leicht E., Holme P., and Newman M. Vertex similarity in networks. Phys. Rev. E 73 2 (2006) 026120
11. Blondel V., Gajardo A., Heymans M., Senellart P., and Van Dooren P. A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev. 46 4 (2004) 647-666
12. Umeyama S. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10 5 (1988) 695-703
13. Almohamad H., and Duffuaa S. A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal Mach. Intell. 15 (1993) 522-525
14. Kuhn H. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2 (1955) 83-97
15. Erdös P., and Rényi A. On random graphs. Publ. Math. 6 (1959) 290-297
16. ® Central File Exchange. http://www.mathworks.com/matlabcentral/fileexchange/. Last accessed: 12/22/2005
17. Zager L.A., and Verghese G.C. Caps and robbers: what can you expect?. College Math. J. 38 3 (2007) 185-191
18. L.A. Zager, Graph similarity and matching, Masters' Thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 2005
19. Holme P., and Huss M. Role-similarity based functional prediction in networked systems: application to the yeast proteome. J. Roy. Soc. Interface 2 4 (2005) 327-333