Computing the Tutte Polynomial on Graphs of Bounded Clique-Width

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.

[1]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[2]  Marc Noy,et al.  On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids , 2006, Combinatorics, Probability and Computing.

[3]  Petr Hlinený,et al.  A Parametrized Algorithm for Matroid Branch-Width , 2005, SIAM J. Comput..

[4]  Udi Rotics,et al.  Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..

[5]  Steven D. Noble,et al.  Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.

[6]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[7]  Petr Hlinený,et al.  The Tutte Polynomial for Matroids of Bounded Branch-Width , 2006, Combinatorics, Probability and Computing.

[8]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[9]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[10]  Marc Noy,et al.  Computing the Tutte Polynomial on Graphs of Bounded Clique-Width , 2006, SIAM J. Discret. Math..

[11]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[12]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[13]  E. S.D.NOBL.  Evaluating the Tutte Polynomial for Graphs of Bounded TreeWidth , 2022 .

[14]  Steven D. Noble,et al.  A weighted graph polynomial from chromatic invariants of knots , 1999 .

[15]  Sang-il Oum,et al.  Approximating rank-width and clique-width quickly , 2005, TALG.

[16]  Artur Andrzejak,et al.  An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..

[17]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.