Publication IEICE TRANSACTIONS on Information and SystemsVol.E76-DNo.6pp.707-710 Publication Date: 1993/06/25 Online ISSN: DOI: Print ISSN: 0916-8532 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: algorithms, macro operator, learning, graph algorithms, subtree,
Full Text: PDF>>
Summary: This paper presents efficient algorithms for finding the largest tree S such that there are vertex disjoint subtrees S1, , S (k1) of T each of which is isomorphic to S and every leaf of T is a leaf of some Si. The algorithms are useful for learning a macro table.
, S
(k
1) of T each of which is isomorphic to S and every leaf of T is a leaf of some Si. The algorithms are useful for learning a macro table.