Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 56

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 192

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 192

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 192

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 192

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 202

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 271

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 296

Warning: Undefined array key "abst" in /var/www/02search_html/bin/keyword.php on line 315
IEICE Trans

Keyword : macro operator

Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves
Tatsuya AKUTSU Satoshi KOBAYASHI Koichi HORI Setsuo OHSUGA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/06/25
Vol. E76-D  No. 6 ; pp. 707-710
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
algorithms, macro operator, learning, graph algorithms, subtree, 
 Summary | Full Text:PDF