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 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 : FPT algorithm

Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial
Farley Soares OLIVEIRA Hidefumi HIRAISHI Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2019/09/01
Vol. E102-A  No. 9 ; pp. 1022-1027
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: Graph algorithms
Keyword: 
BDD, Tutte polynomial, graph, pathwidth, FPT algorithm, 
 Summary | Full Text:PDF