Skip to main content
SpringerLink
Log in

Computing Graph Polynomials on Graphs of Bounded Clique-Width

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4271))

Included in the following conference series:

Abstract

We discuss the complexity of computing various graph polynomials of graphs of fixed clique-width. We show that the chromatic polynomial, the matching polynomial and the two-variable interlace polynomial of a graph G of clique-width at most k with n vertices can be computed in time O(n f( k)), where f(k) ≤3 for the inerlace polynomial, f(k) ≤2k+1 for the matching polynomial and f(k) ≤3 2k + 2 for the chromatic polynomial.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arratia, R., Bollobas, B., Sorkin, G.B.: The interlace polynomial: a new graph polynomial. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Mathematics, pp. 237–245 (2000)

    Google Scholar 

  2. Arratia, R., Bollobas, B., Sorkin, G.B.: The interlace polynomial: a new graph polynomial. Journal of Combinatorial Theory, Series B 92, 199–233 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arratia, R., Bollobas, B., Sorkin, G.B.: A two-variable interlace polynomial. Combinatorica 24(4), 567–584 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embedding in a k–tree. SIAM. J. Algebraic Discrete Methods 8, 277–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Andrzejak, A.: An algorithm for the Tutte polynomials of graphs of bounded treewidth. Discrete Mathematics 190, 39–54 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Aigner, M., van der Holst, H.: Interlace polynomials. Linear Algebra and Applications 377, 11–30 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, New York (1998)

    Google Scholar 

  8. Babić, D., Graovac, A., Mohar, B., Pisanski, T.: The matching polynomial of a polygraph. Discrete Applied Mathematics 15, 11–24 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  10. Birkhoff, G.D.: A determinant formula for the number of ways of coloring a map. Annals of Mathematics 14, 42–46 (1912)

    Article  MathSciNet  Google Scholar 

  11. Bollobás, B.: Modern Graph Theory. Springer, Heidelberg (1999)

    Google Scholar 

  12. Cvetković, D.M., Doob, M., Sachs, H.: Spectra of graphs, Johann Ambrosius Barth, 3rd edn. (1995)

    Google Scholar 

  13. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Applied Mathematics 108(1-2), 23–52 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Courcelle, B., Olariu, S.: Upper bounds to the clique–width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory, Series B, xx:xx–xx (2006)

    Google Scholar 

  17. Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34(4), 825–847 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Downey, R.G., Fellows, M.F.: Parametrized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  19. Diestel, R.: Graph Theory. In: Graduate Texts in Mathematics. Springer, Heidelberg (1996)

    Google Scholar 

  20. Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic polynomials and chromaticity of graphs. World Scientific, Singapore (2005)

    Book  MATH  Google Scholar 

  21. Fürer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-SAT solutions and colorings with applications. Electronic Colloquium on Computational Complexity 1, R33 (2003)

    Google Scholar 

  22. Fischer, E., Makowsky, J.A., Ravve, E.V.: Counting truth assignments of formulas of bounded tree width and clique-width. Discrete Applied Mathematics, xx:xx–xx (2006)

    Google Scholar 

  23. Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Proving NP-hardness for clique width. In: ECCC, xx:xx–yy (2005)

    Google Scholar 

  24. Giménez, O., Hliněný, P., Noy, M.: Computing the Tutte polynomial on graphs of bounded clique-width. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 59–68. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Giménez, O., Hlinĕný, P., Noy, M.: Computing the Tutte polynomial on graphs of bounded clique-width. XXX, xx:xx–yy (2006)

    Google Scholar 

  26. Godsil, C., Royle, G.: Algebraic Graph Theory. In: Graduate Texts in Mathematics. Springer, Heidelberg (2001)

    Google Scholar 

  27. Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Phil. Soc. 108, 35–53 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  28. Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126, 197–221 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  29. Lovasz, L., Plummer, M.: Matching Theory. North-Holland, Amsterdam (1986)

    MATH  Google Scholar 

  30. Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126, 1–3 (2004)

    Article  MathSciNet  Google Scholar 

  31. Noble, S.D.: Evaluating the Tutte polynomial for graphs of bounded tree-width. Combinatorics, Probability and Computing 7, 307–321 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  32. Oum, S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Ser. B, xx(x):xx–yy (2005)

    Google Scholar 

  33. Oxley, J.G., Welsh, D.J.A.: Tutte polynomials computable in polynomial time. Discrete Mathematics 109, 185–192 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  34. Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading (1994)

    MATH  Google Scholar 

  35. Stanley, R.P.: Acyclic orientations of graphs. Discrete Mathematics 5, 171–178 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  36. Trinajstić, N.: Chemical graph theory, 2nd edn. CRC Press, Boca Raton (1992)

    Google Scholar 

  37. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), 410–421 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  38. Vertigan, D.L., Welsh, D.J.A.: The computational complexity of the Tutte plane: The bipartite case. Combinatorics, Probability, and Computing 1, 181–187 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  39. Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Notes Series, vol. 186. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion–Israel Institute of Technology, Haifa, Israel

    J. A. Makowsky, Ilya Averbouch & Benny Godlin

  2. School of Computer Science and Mathematics, Netanya Academic College, Netanya, Israel

    Udi Rotics

  3. IBM Research and Development Laboratory, Haifa, Israel

    Benny Godlin

Authors
  1. J. A. Makowsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Udi Rotics
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ilya Averbouch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Benny Godlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Fedor V. Fomin

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B. (2006). Computing Graph Polynomials on Graphs of Bounded Clique-Width. In: Fomin, F.V. (eds) Graph-Theoretic Concepts in Computer Science. WG 2006. Lecture Notes in Computer Science, vol 4271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11917496_18

Download citation

  • DOI: https://doi.org/10.1007/11917496_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48381-6

  • Online ISBN: 978-3-540-48382-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation