Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves

Tatsuya AKUTSU; Satoshi KOBAYASHI; Koichi HORI; Setsuo OHSUGA

Copy

Tatsuya AKUTSU, Satoshi KOBAYASHI, Koichi HORI, Setsuo OHSUGA, "Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves" in IEICE TRANSACTIONS on Information, vol. E76-D, no. 6, pp. 707-710, June 1993, doi: .
Abstract: This paper presents efficient algorithms for finding the largest tree S such that there are vertex disjoint subtrees S₁, , S (k1) 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e76-d_6_707/_p

Copy

@ARTICLE{e76-d_6_707,
author={Tatsuya AKUTSU, Satoshi KOBAYASHI, Koichi HORI, Setsuo OHSUGA, },
journal={IEICE TRANSACTIONS on Information},
title={Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves},
year={1993},
volume={E76-D},
number={6},
pages={707-710},
abstract={This paper presents efficient algorithms for finding the largest tree S such that there are vertex disjoint subtrees S₁, , S (k1) 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.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves
T2 - IEICE TRANSACTIONS on Information
SP - 707
EP - 710
AU - Tatsuya AKUTSU
AU - Satoshi KOBAYASHI
AU - Koichi HORI
AU - Setsuo OHSUGA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1993
AB - This paper presents efficient algorithms for finding the largest tree S such that there are vertex disjoint subtrees S₁, , S (k1) 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.
ER -