An algorithm for the Tutte polynomials of graphs of bounded treewidth
Discrete Mathematics
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Combinatorics, Probability and Computing
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
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
A Most General Edge Elimination Polynomial
Graph-Theoretic Concepts in Computer Science
An extension of the bivariate chromatic polynomial
European Journal of Combinatorics
Maximal matching and path matching counting in polynomial time for graphs of bounded clique width
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without induced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time expO(n2/3)) for computing the Tutte polynomial on cographs. The algorithm can be extended to a subexponential algorithm computing the Tutte polynomial on on all graphs of bounded clique-width. In fact, our algorithm computes the more general U-polynomial. 2000 Math Subjects Classification: 05C85, 68R10.