Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. P. Dublish, Some comments on the subtree isomorphism problem for ordered trees, Information Processing Letters, 36: 273–275, 1990.
2. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman and Co., 1979.
3. J.E. Hopcroft and J.K. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. of 6th Annual ACM Symposium on Theory of Computing, 172–184, 1974.
4. X. Jiang and H. Bunke, A simple and efficient algorithm for determining the symmetries of polyhedra, Graphical Models and Image Processing, 54(1):91–95, 1992.
5. X. Jiang, K. Yu, and H. Bunke, Detection of rotational and involutational symmetries and congruity of polyhedra, The Visual Computer, 12(4): 193–201, 1996.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献