未找到相关数据
ALGORITHMS FOR FINDING THE LARGEST SUBTREE WHOSE COPIES COVER ALL THE LEAVES
被引：0
作者：
AKUTSU, T
KOBAYASHI, S
HORI, K
OHSUGA, S
机构：
关键词：
ALGORITHMS;
MACRO OPERATOR;
LEARNING;
GRAPH ALGORITHMS;
SUBTREE;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents efficient algorithms for finding the largest tree S such that there are vertex disjoint subtrees S1, ... , S(k) (k > 1) of T each of which is isomorphic to S and every leaf of T is a leaf of some S(i). The algorithms are useful for learning a macro table.
引用
收藏
页码：707 / 710
页数：4
相关论文