Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
暂无分享,去创建一个
[1] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..
[2] James G. Oxley,et al. Tutte polynomials computable in polynomial time , 1992, Discret. Math..
[3] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[4] D. Welsh,et al. On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.
[5] Tom Brylawski,et al. Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .
[6] Dominic J. A. Welsh,et al. The Computational Complexity of the Tutte Plane: the Bipartite Case , 1992, Combinatorics, Probability and Computing.
[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[8] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.