Author:
Lipets V.,Vanetik N.,Gudes E.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference41 articles.
1. Akinniyi FA, Wong AKC, Stacey DA (1986) A new algorithm for graph monomorphism based on the projections of the product graph. Trans Systems, Man and Cybernetics SMC-16: 740–751
2. Alon N, Yuster R, Zwick U (1995) Color-coding Electronic colloquium on computational complexity (ECCC). 1(009), 1994. Full paper appears in J ACM 42(4): 44–856
3. Ambauen R, Fischer S, Bunke H (2003) Graph edit distance with node splitting and merging, and its application to diatom identification. Lecture notes in computer science, vol 2726, pp 259–264
4. Bunke H, Messmer BT (2000) Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans Knowl Data Eng 12: 307–323
5. Batz GV (2006) An optimization technique for subgraph matching strategies. Technical report 2006–2007, Universitat Karlsruhe, Faculty of Informatik
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献