|
| Keyword : pathwidth
| |
|
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 | |
| |
| |
|
Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
Masataka IKEDA Hiroshi NAGAMOCHI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D
No. 3 ;
pp. 503-511
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category:
Keyword:
pathwidth, exact algorithms, graphs, chemical graphs, | | | Summary | Full Text:PDF | |
| |
|
|