Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

  • Martin Fürer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5757)


An O(n log2 n) algorithm is presented to compute the characteristic polynomial of a tree on n vertices improving on the previously best quadratic time. With the same running time, the algorithm can be generalized in two directions. The algoritm is a counting algorithm, and the same ideas can be used to count other objects. For example, one can count the number of independent sets of all possible sizes simultaneously with the same running time. These counting algorithms not only work for trees, but can be extended to arbitrary graphs of bounded tree-width.


characteristic polynomial counting matchings counting independent sets bounded tree-width efficient algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Biggs, N.: Algebraic graph theory, 2nd edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)zbMATHGoogle Scholar
  2. 2.
    Tinhofer, G., Schreck, H.: Computing the characteristic polynomial of a tree. Computing 35(2), 113–125 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Keller-Gehrig, W.: Fast algorithms for the characteristic polynomial. Theor. Comput. Sci. 36(2,3), 309–317 (1985)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Grundlehren der Mathematischen Wissenschaften or Fundamental Principles of Mathematical Sciences, vol. 315. Springer, Berlin (1997); With the collaboration of Thomas LickteigzbMATHGoogle Scholar
  5. 5.
    Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Fricke, G.H., Hedetniemi, S., Jacobs, D.P., Trevisan, V.: Reducing the adjacency matrix of a tree. Electron. J. Linear Algebra 1, 34–43 (1996) (electronic)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Mohar, B.: Computing the characteristic polynomial of a tree. J. Math. Chem. 3(4), 403–406 (1989)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Jacobs, D.P., Machado, C.M.S., Trevison, V.: An \(O(n\sp 2)\) algorithm for the characteristic polynomial of a tree. J. Combin. Math. Combin. Comput. 54, 213–221 (2005)MathSciNetGoogle Scholar
  9. 9.
    Ellis-Monaghan, J., Merino, C.: Graph polynomials and their applications ii: Interrelations and interpretations (2008)Google Scholar
  10. 10.
    Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108(1-2), 23–52 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Makowsky, J., Marino, J.: Farrell polynomials on graphs of bounded tree width. Advances in Applied Mathematics 30, 160–176 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Makowsky, J.A.: From a zoo to a zoology: Descriptive complexity for graph polynomials. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 330–341. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Bläser, M., Hoffmann, C.: Fast computation of interlace polynomials on graphs of bounded treewidth. CoRR abs/0902.1693 (2009); 35 pages informal publicationGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Martin Fürer
    • 1
    • 2
  1. 1.Department of Computer Science and Engineering Pennsylvania State University, University Park, PA 16802,USA Visiting: ALGO EPFL 1015 LausanneSwitzerland
  2. 2.Institut für MathemtikUniversität ZürichZrichSwitzerland

Personalised recommendations