Graph homomorphism revisited for graph matching

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 1161-1172

  Fan, Wenfei ^a,b   Li, Jianzhong ^b   Ma, Shuai ^a   Wang, Hongzhi ^b   Wu, Yinghui ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PATTERN MATCHING; SET THEORY; TOPOLOGY;

DECISION PROBLEMS; EMERGING APPLICATIONS; GRAPH HOMOMORPHISMS; GRAPH SIMILARITY; OPTIMIZATION PROBLEMS; STRUCTURAL SIMILARITY; SUBGRAPH ISOMORPHISM; TOPOLOGICAL STRUCTURE;

GRAPH THEORY;

EID: 79957793038     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920986     Document Type: Article

References (32)

1. Chemistry development kit (cdk). http://sourceforge.net/projects/cdk/.
2. Stanford webbase. http://diglib.stanford.edu:8091/testbed/doc2/WebBase.
3. M. Aery and S. Chakravarthy.eMailSift: Email classification based on structure and content. In ICDM, 2005.
4. K. Bharat and A. Broder.Mirror, mirror on the Web: a study of host pairs with replicated content. Comput. Netw., 31(11-16), 1999.
5. K. Bharat et al.A comparison of techniques to find mirrored hosts on the WWW. J. Am. Soc. Inf. Sci., 51(12), 2000.
6. V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. V. Dooren.A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Rev., 46(4), 2004.
7. R. B. Boppana and M. M. Halldórsson.Approximating maximum independent sets by excluding subgraphs. BIT, 32(2), 1992.
8. A. Z. Broder, S. C. Glassman,M. S.Manasse, and G. Zweig.Syntactic clustering of the Web. Comput. Netw. ISDN Syst., 29(8-13), 1997.
9. H. Bunke.Graph matching: Theoretical foundations, algorithms, and applications. Vision Interface, 3, 2000.
10. L. Chen, A. Gupta, and M. E. Kurul.Stack-based algorithms for pattern matching on dags. In VLDB, 2005.
11. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang.Fast graph pattern matching. In ICDE, 2008.
12. J. Cho, N. Shivakumar, and H. Garcia-Molina.Finding replicated Web collections. SIGMOD Rec., 29(2), 2000.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2001.
14. W. Fan and P. Bohannon. Information preserving XML schema embedding. TODS, 33(1), 2008.
15. M. Garey and D. Johnson.Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
16. M. M. Halldórsson.Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms Appl., 4(1), 2000.
17. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke.Computing simulations on finite and infinite graphs. In FOCS, 1995.
18. S. Joshi et al.A bag of paths model for measuring structural similarity in Web documents. In KDD, 2003.
19. V. Kann.On the approximability of the maximum common subgraph problem. In STACS, 1992.
20. C. Liu, C. Chen, J. Han, and P. S. Yu.Gplag: Detection of software plagiarism by program dependence graph analysis. In SIGKDD, 2006.
21. S. Melnik, H. Garcia-Molina, and E. Rahm.Similarity flooding: A versatile graph matching algorithm. In ICDE, 2002.
22. E. Nuutila.An efficient transitive closure algorithm for cyclic digraphs. Inf. Process. Lett., 52(4), 1994.
23. P. Papadimitriou, A. Dasdan, and H. Garcia-Molina.Web graph similarity for anomaly detection. Technical report, 2008.
24. I. Sanz, M. Mesiti, G. Guerrini, and R. B. Llavori.Fragment-based approximate retrieval in highly heterogeneous XML collections. Data Knowl. Eng., 64(1):266-293, 2008.
25. A. Schenker, M. Last, H. Bunke, and A. Kandel.Classification ofWeb documents using graph matching. IJPRAI, 18(3), 2004.
26. D. Shasha, J. T. L. Wang, and R. Giugno.Algorithmics and applications of tree and graph searching. In PODS, 2002.
27. Y. Tian and J. M. Patel.Tale: A tool for approximate large graph matching. In ICDE, 2008.
28. V. V. Vazirani.Approximation Algorithms. Springer, 2003.
29. Webconfs. Similar page checker. www.webconfs.com/similar-pagechecker. php.
30. X. Yan, P. S. Yu, and J. Han.Substructure similarity search in graph databases. In SIGMOD, 2005.
31. Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou.Edit distance evaluation on graph structures. In VLDB, 2009.
32. L. Zou, L. Chen, and M. T. Özsu.Distance-join: Pattern match query in a large graph database. In VLDB, 2009.