Author:
Yamaguchi Atsuko,Aoki Kiyoko F.,Mamitsuka Hiroshi
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference13 articles.
1. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree;Akutsu;IEICE Trans. Fundamentals,1993
2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. on Algebraic and Discrete Methods,1987
3. Linear time algorithms for NP-hard problems on graphs embedded in k-trees;Arnborg;Discrete Appl. Math.,1989
4. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
5. Mean and maximum common subgraph of two graphs;Bunke;Pattern Recognition Lett.,2000
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献