Comparing large graphs efficiently by margins of feature vectors

Applied Mathematics and Computation

Volumn 188, Issue 2, 2007, Pages 1699-1710

  Dehmer, Matthias ^a,b   Emmert Streib, Frank ^c  

^a MAX F PERUTZ LABORATORIES   (Austria)

^b MEDICAL UNIVERSITY OF VIENNA   (Austria)

^c STOWERS INSTITUTE FOR MEDICAL RESEARCH   (United States)

Author keywords

Degree vectors; Directed and undirected graphs; Graph similarity; Similarity measures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; PROBLEM SOLVING; VECTOR QUANTIZATION;

DEGREE VECTORS; DIRECTED GRAPHS; GRAPH SIMILARITY; SIMILARITY MEASURES; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 34248165422     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.11.185     Document Type: Article

References (25)

1. Bang-Jensen J., Gutin G., and Theory Digraphs. Algorithms and Applications (2000), Springer-Verlag, London, Berlin, Heidelberg
2. Bunke H. What is the distance between graphs. Bulletin of the EATCS 20 (1983) 35-39
3. H. Bunke, G. Allermann, A metric on graphs for structural pattern recognition, in: H.W. Schüssler (Ed.), Signal Processing II: Theory and Applications, 1983, pp. 257-260.
4. H. Bunke, Graph matching: Theoretical foundations, algorithms, and applications, in: Proceedings of Vision Interface 2000, Montreal/Canada, 2000, pp. 82-88.
5. P.A. Champin, C. Solnon, Measuring the similarity of labeled graphs, in: Proceedings of the Fifth International Conference on Case-Based Reasoning, Trondheim, Springer Verlag, Berlin, 2003, pp. 80-95.
6. Cristianini N., and Shawe-Taylor J. An Introduction to Support Vector Machines (2000), Cambridge University Press, Cambridge, England
7. M. Dehmer, Strukturelle Analyse Web-basierter Dokumente. Gabler Edition Wissenschaft - Deutscher Universitätsverlag, in: F. Lehner, F. Bodendorf (Eds.), Series: Multimedia und Telekooperation, 2006.
8. Gernert D. Measuring the similarity of complex structures by means of graph grammars. Bulletin of the EATCS 7 (1979) 3-9
9. Gernert D. Graph grammars which generate graphs with specified properties. Bulletin of the EATCS 13 (1981) 13-20
10. Gernert D. Graph grammars as an analytical tool in physics and biology. Biosystems 43 (1977) 179-187
11. Harary F. Graph Theory (1994), Addison-Wesley
12. J.M. Jolion, Graph matching: What we are really talking about? in: Proceedings of the Third IAPR Workshop on Graph-based Representations in Pattern Recognition, Ischia/Italy, 2001.
13. Kaden F. Graphmetriken und Distanzgraphen. ZKI-Informationen. Akademie der Wissenschaften der DDR (1982) 1-63
14. Kaden F. Graphmetriken und Isometrieprobleme zugehöriger Distanzgraphen. ZKI-Informationen. Akademie der Wissenschaften der DDR (1986) 1-100
15. Lorenz M.O. Methods for measuring concentration of wealth. Journal of American Statistical Association 9 (1905) 209-219
16. Marshall A.W., and Olkin I. Inequalities: Theory of Majorization and its Applications (1979), Academic Press, San Diego
17. K. Schädler, Die Ermittlung struktureller Ähnlichkeit und struktureller Merkmale bei komplexen Objekten: Ein konnektionistischer Ansatz und seine Anwendungen. Dissertation, Technische Universität Berlin, 1999.
18. L. Shapiro, Organization of relational models, in: Proceedings of the International Conference on Pattern Recognition, München, 1982, pp. 360-365.
19. Sobik F. Graphmetriken und Klassifikation strukturierter Objekte ZKI-Informationen. Akademie der Wissenschaften der DDR 2 82 (1982) 63-122
20. Sobik F., and Sommerfeld E. A graph theoretic approach to the characterization of classes of structured objects. Computers and Artificial Intelligence 3 (1984) 235-247
21. Tversky A. Features of similarity. Psychological Review 84 4 (1977) 327-352
22. Ullman J.R. An algorithm for subgraph isomorphism. Journal of ACM 23 1 (1976) 31-42
23. Weyl H. Inequalities between two kinds of eigenvalues of a linear transformation. Proceedings of the National Academy of Sciences of the USA 35 (1949) 408-411
24. Zhang K., Statman R., and Shasha D. On the editing distance between unordered labeled trees. International Information Processing Letter 42 3 (1992) 133-139
25. Zelinka B. On a certain distance between isomorphism classes of graph. Časopis pro pěst. Matematiky 100 (1975) 371-373