An algorithm for the Tutte polynomials of graphs of bounded treewidth
type: Item
instance of: scholarly article
title: An algorithm for the Tutte polynomials of graphs of bounded treewidth
zbMATH Open document ID: 0955.05101
DOI: 10.1016/S0012-365X(98)00113-7
author: Artur Andrzejak
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1524980
zbMATH Keywords: computational complexity
zbMATH Keywords: algorithm
zbMATH Keywords: Tutte polynomial
zbMATH Keywords: treewidth
MaRDI profile type: Publication
cites work: Q3050437
cites work: Splitting formulas for Tutte polynomials
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Easy problems for tree-decomposable graphs
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Q4291429
cites work: Parallel algorithms with optimal speedup for bounded treewidth
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Q4012032
cites work: The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
cites work: On the computational complexity of the Jones and Tutte polynomials
cites work: Q4385522
cites work: Polynomial Invariants of Graphs
cites work: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
cites work: Tutte polynomials computable in polynomial time
cites work: The Computational Complexity of Tutte Invariants for Planar Graphs
cites work: Q3140234
cites work: The computational complexity of knot and matroid polynomials
description: scientific article; zbMATH DE number 1524980