Computing the tutte polynomial on graphs of bounded clique-width

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 4, 2007, Pages 932-946

  Giménez, Omer ^a   Hliněný, Petr ^b   Noy, Marc ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Clique width; Cographs; Subexponential algorithm; Tutte polynomial; U polynomial

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY;

COGRAPHS; SUBEXPONENTIAL ALGORITHMS; TUTTE POLYNOMIALS; U POLYNOMIALS;

POLYNOMIALS;

EID: 36249011403     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050645208     Document Type: Article

References (16)

1. G. E. ANDREWS, The Theory of Partitions, Cambridge University Press, Cambridge, UK, 1984.
2. A. ANDRZEJAK, An algorithm for the Tutte polynomials of graphs of bounded treewidth, Discrete Math., 190 (1998), pp. 39-54.
3. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Systems, 33 (2000), pp. 125-150.
4. B. COURCELLE AND S. OLARIU, Upper bounds to the clique width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
5. D. G. CORNEIL, Y. PERL, AND L. K. STEWART, A linear recognition algorithm for cographs, SIAM J. Comput., 14 (1985), pp. 926-934.
6. O. GIMÉNEZ AND M. NOY, On the complexity of computing the Tutte polynomial of bicircular matroids, Combin. Probab. Comput., 15 (2006), pp. 385-395.
7. P. HLINĚNÝ, A parametrized algorithm for matroid branch-width, SIAM J. Comput., 35 (2005), pp. 259-277 (electronic).
8. P. HLINĚNÝ, The Tutte polynomial for matroids of bounded branch-width, Combin. Probab. Comput., 15 (2006), pp. 397-409.
9. F. JAEGER, D. L. VERTIGAN, D. J. A. WELSH, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc., 108 (1990), pp. 35-53.
10. D. KOBLER AND U. ROTICS, Edge dominating set and colorings on graphs with fixed cliquewidth, Discrete Appl. Math., 126 (2003), pp. 197-221.
11. J. H. VAN LINT AND R. M. WILSON, A Course in Combinatorics, Cambridge University Press, Cambridge, UK, 1992.
12. J. A. MAKOWSKY AND U. ROTICS, Computing the Chromatic Polynomial on Graphs of Bounded Clique-Width, preprint, 2005.
13. S. D. NOBLE, Evaluating the Tutte polynomial for graphs of bounded tree-width, Combin. Probab. Comput., 7 (1998), pp. 307-321.
14. S. D. NOBLE AND D. J. A. WELSH, A weighted graph polynomial from chromatic invariants of knots, Ann. Inst. Fourier (Grenoble), 49 (1999), pp. 1057-1087.
15. S.-I. OUM, Approximating rank-width and clique-width quickly, in Lecture Notes in Comput. Sci. 3787, Springer, Berlin, 2005, pp. 49-58.
16. S.-I. OUM AND P. D. SEYMOUR, Approximating clique-width and brunch-width, J. Combin. Theory Ser. B, 96 (2006), pp. 514-528.