Abstract
An O(nlog2 n) algorithm is presented to compute all coefficients of 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 algorithm is a counting algorithm for matchings, 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.
Similar content being viewed by others
References
Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)
Tinhofer, G., Schreck, H.: Computing the characteristic polynomial of a tree. Computing 35(2), 113–125 (1985)
Keller-Gehrig, W.: Fast algorithms for the characteristic polynomial. Theor. Comput. Sci. 36(2,3), 309–317 (1985)
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 315. Springer, Berlin (1997)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251–280 (1990)
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)
Mohar, B.: Computing the characteristic polynomial of a tree. J. Math. Chem. 3(4), 403–406 (1989)
Schönhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing 7, 281–292 (1971)
Fürer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979–1005 (2009)
Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discrete Methods 8, 277–284 (1987)
Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
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)
Makowsky, J.A.: From a zoo to a zoology: Towards a general theory of graph plynomials. Theory Comput. Syst. 43(3–4), 542–562 (2008)
Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by NSF Grants CCF-0728921 and CCF-0964655. Part of this research has been done while visiting the Laboratory of Algorithms (ALGO) at EPFL Lausanne and the Institute for Mathematics at the University of Zürich.
A preliminary version of this paper appeared in LNCS 5757, Proc. 17th ESA 2009, pp. 11–22.
Rights and permissions
About this article
Cite this article
Fürer, M. Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. Algorithmica 68, 626–642 (2014). https://doi.org/10.1007/s00453-012-9688-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-012-9688-5