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 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 : random NC algorithms


An RNC Algorithm for Finding a Largest Common Subtree of Two Trees
Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1 ; pp. 95-101
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
largest common subtreesubgraph isomorphismparallel algorithmsrandom NC algorithmsdynamic tree contraction
 Summary | Full Text:PDF