Computing graph polynomials on graphs of bounded clique-width

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4271 LNCS, Issue , 2006, Pages 191-204

  Makowsky, J A ^a   Rotics, Udi ^b   Averbouch, Ilya ^a   Godlin, Benny ^a,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NETANYA ACADEMIC COLLEGE   (Israel)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; GRAPH THEORY;

CHROMATIC POLYNOMIALS; COMPUTING GRAPH POLYNOMIALS; TWO VARIABLE INTERLACE POLYNOMIALS;

POLYNOMIALS;

EID: 33845543520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_18     Document Type: Conference Paper

References (39)

1. [ABS00] R. Arratia, B. Bollobas, and G.B. Sorkin. The interlace polynomial: a new graph polynomial. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Mathematics, pages 237-245, 2000.
2. [ABS04a] R. Arratia, B. Bollobas, and G.B. Sorkin. The interlace polynomial: a new graph polynomial. Journal of Combinatorial Theory, Series B, 92:199-233, 2004.
3. [ABS04b] R. Arratia, B. Bollobas, and G.B. Sorkin. A two-variable interlace polynomial. Combinatorica, 24.4:567-584, 2004.
4. [ACP87] S. Arnborg, D.G. Cornell, and A. Proskurowski. Complexity of finding embedding in a k-tree. SIAM. J. Algebraic Discrete Methods, 8:277-284, 1987.
5. [And98] A. Andrzejak. An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Mathematics, 190:39-54, 1998.
6. [AvdH04] M. Aigner and H. van der Holst. Interlace polynomials. Linear Algebra and Applications, 377:11-30, 2004.
7. [BCSS98] L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and real computation. Springer-Verlag, New York, 1998.
8. [BGMP86] D. Babić, A. Graovac, B. Mohar, and T. Pisanski. The matching polynomial of a polygraph. Discrete Applied Mathematics, 15:11-24, 1986.
9. [Big93] N. Biggs. Algebraic Graph Theory, 2nd edition. Cambridge University Press, 1993.
10. [Bir12] G.D. Birkhoff. A determinant formula for the number of ways of coloring a map. Annals of Mathematics, 14:42-46, 1912.
11. [Bol99] B. Bollobás. Modern Graph Theory. Springer, 1999.
12. [CDS95] D.M. Cvetković, M. Doob, and H. Sachs. Spectra of graphs. Johann Ambrosius Earth, 3 edition, 1995.
13. [CER93] B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hyper-graph grammars. J. Comput. System Sci., 46:218-270, 1993.
14. [CMR01] B. Courcelle, J.A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Applied Mathematics, 108(1-2):23-52, 2001.
15. [CO00] B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. Discrete Applied Mathematics, 101:77-114, 2000.
16. [CO06] B. Courcelle and S. Oum. Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory, Series B, xx:xx-xx, 2006.
17. [CR05] D. G. Corneil and U. Rotics. On the relationship between clique-width and treewidth. SIAM J. Comput., 34(4):825-847, 2005.
18. [DF99] R.G. Downey and M.F Fellows. Parametrized Complexity. Springer, 1999.
19. [Die96] R. Diestel. Graph Theory. Graduate Texts in Mathematics. Springer, 1996.
20. [DKT05] F.M. Dong, K.M. Koh, and K.L. Teo. Chromatic polynomials and chromaticity of graphs. World Scientific, 2005.
21. [FK03] M. Fürer and S. P. Kasiviswanathan. Algorithms for counting 2-SAT solutions and colorings with applications. Electronic Colloquium on Computational Complexity, 1:R 33, 2003.
22. [FMR06] E. Fischer, J.A. Makowsky, and E.V. Ravve. Counting truth assignments of formulas of bounded tree width and clique-width. Discrete Applied Mathematics, xx:xx-xx, 2006.
23. [FRRS05] M.R. Fellows, F.A. Rosamond, U. Rotics, and S. Szeider. Proving NP-hardness for clique width. ECCC, xx:xx-yy, 2005.
24. [GHN05] O. Giménez, P. Hliněný, and M. Noy. Computing the Tutte polynomial on graphs of bounded clique-width. In Graph Theoretic Concepts in Computer Science, WG 2005, volume 3787 of Lecture Notes in Computer Science, pages 59-68, 2005.
25. [GHN06] O. Giménez, P. Hliněný, and M. Noy. Computing the Tutte polynomial on graphs of bounded clique-width. XXX, xx:xx-yy, 2006.
26. [GR01] C. Godsil and G. Royle. Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, 2001.
27. [JVW90] F. Jaeger, D.L. Vertigan, and D.J.A. Welsh. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Phil. Soc., 108:35-53, 1990.
28. [KR03] D. Kobler and U. Rotics. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics, 126:197-221, 2003.
29. [LP86] L. Lovasz and M. Plummer. Matching Theory. North Holland, 1986.
30. [Mak04] J.A. Makowsky. Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic, 126:1-3, 2004.
31. [Nob98] S.D. Noble. Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics, Probability and Computing, 7:307-321, 1998.
32. [OS05] S. Oum and P. Seymour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Ser. B, xx(x):xx-yy, 2005.
33. [OW92] J.G. Oxley and D.J.A. Welsh. Tutte polynomials computable in polynomial time. Discrete Mathematics, 109:185-192, 1992.
34. [Pap94] C. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
35. [Sta73] R. P. Stanley. Acyclic orientations of graphs. Discrete Mathematics, 5:171-178, 1973.
36. [Tri92] N. Trinajstić. Chemical graph theory. CRC Press, 2 edition, 1992.
37. [Val79] L.G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
38. [VW92] D.L. Vertigan and D.J.A. Welsh. The computational complexity of the Tutte plane: The bipartite case. Combinatorics, Probability, and Computing, 1:181-187, 1992.
39. [Wel93] D.J.A. Welsh. Complexity: Knots, Colourings and Counting, volume 186 of London Mathematical Society Lecture Notes Series. Cambridge University Press, 1993.