An algorithm for the Tutte polynomials of graphs of bounded treewidth

Discrete Mathematics

Volumn 190, Issue 1-3, 1998, Pages 39-54

  Andrzejak, Artur ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Bounded treewidth; Computational complexity; Tutte polynomial

Indexed keywords

EID: 0001919985     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00113-7     Document Type: Article

References (20)

1. M. Aigner, Combinatorial Theory, Springer, New York, 1979.
2. A. Andrzejak, Splitting formulas for Tutte polynomials, J. Combin. Theory Ser. B 70 (1997) 346-366.
3. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, BIT 25 (1985) 2-23.
4. S. Arnborg, J. Lagergren, D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (2) (1991) 308-340.
5. S. Arnborg, A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1) (1989) 11-24.
6. H.L. Bodlaender, NC-Algorithms for graphs with small treewidth, in: J. van Leeuwen (Ed.), WG'88, Amsterdam, Netherlands, Springer, Berlin, 344, 1989, pp. 1-10.
7. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
8. H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11 (1-2) (1993) 1-21.
9. H.L. Bodlaender, T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, ICALP'95, Szeged, Hungary, Springer, Berlin, 944, 1995, 268-290.
10. R.P. Brent, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach. 21 (1974) 201-206.
11. T. Brylawski, J. Oxley, The Tutte polynomial and its applications, Matroid applications, Encycl. Math. Appl., vol. 40, 1992, pp. 123-225.
12. I.M. Gessel, B.E. Sagan, The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions, Electronic J. Comb. 3 (2) The Foata Festschrift, 1996.
13. F. Jaeger, D.L. Vertigan, D.J.A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Camb. Philos. Soc. 108 (1) (1990) 35-53.
14. R.M. Karp, V. Ramachandran, Parallel algorithms for shared-memory machines, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, MIT Press, Cambridge, MA, 1990, pp. 869-941.
15. S. Negami, Polynomial Invariants of Graphs, Trans. Am. Math. Soc. 299 (1987) 601-622.
16. S. Noble, Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width, private communication.
17. J.G, Oxley, D.J.A. Welsh, Tutte polynomials computable in polynomial time, Discrete Math. 109 (1-3) (1992) 185-192.
18. V.L. Vertigan, The computational complexity of Tutte invariants for planar graphs, to appear.
19. D.J.A. Welsh, Complexity: Knots, colourings and counting, London Mathematical Society Lecture Note Series, vol. 186, Cambridge University Press, Cambridge, 1993.
20. D.J.A. Welsh, The computational complexity of knot and matroid polynomials, Discrete Math. 124 (1-3) (1994) 251-269.