Author:
Akutsu Tatsuya,Halldórsson Magnús M.
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. T. Akutsu, An RNC algorithm for finding a largest common subtree of two trees, IEICE Trans. Inform. Systems E75-D (1992) 95–101.
2. T. Akutsu, A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree, IEICE Trans. Fundam. Electron. Comm. Comput. Sci. E76-A (1993) 1488–1493.
3. T. Akutsu, M.M. Halldórsson, On the approximation of largest common point sets and largest common subtrees, in: Proc. 5th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 405–413.
4. Congruence, similarity, and symmetries of geometric objects;Alt;Discrete Comput. Geometry,1988
5. Graphical representation of molecules and substructure-search queries in MACCS;Anderson;J. Molecular Graphics,1984
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献