Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Tutte polynomials computable in polynomial time
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Combinatorics, Probability and Computing
Chromatic Roots are Dense in the Whole Complex Plane
Combinatorics, Probability and Computing
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid
Combinatorics, Probability and Computing
The Tutte Polynomial for Matroids of Bounded Branch-Width
Combinatorics, Probability and Computing
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Combinatorics, Probability and Computing
The Complexity of Counting Colourings of Subgraphs of the Grid
Combinatorics, Probability and Computing
On the colored Tutte polynomial of a graph of bounded treewidth
Discrete Applied Mathematics
Fast exponential-time algorithms for the forest counting in graph classes
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note: On the colored Tutte polynomial of a graph of bounded treewidth
Discrete Applied Mathematics
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The enumeration of vertex induced subgraphs with respect to the number of components
European Journal of Combinatorics
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Computing the tutte polynomial on graphs of bounded clique-width
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Logic and Program Semantics
| Hi-index | 0.00 |
It is known that evaluating the Tutte polynomial, T(G; x, y), of a graph, G, is #P-hard at all but eight specific points and one specific curve of the (x, y)-plane. In contrast we show that if k is a fixed constant then for graphs of tree-width at most k there is an algorithm that will evaluate the polynomial at any point using only a linear number of multiplications and additions.