Farley Soares OLIVEIRA

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 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
BDDTutte polynomialgraphpathwidthFPT algorithm
 Summary | Full Text:PDF(775.5KB)