Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
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.
Keywordscharacteristic polynomial counting matchings counting independent sets bounded tree-width efficient algorithms
Unable to display preview. Download preview PDF.
- 9.Ellis-Monaghan, J., Merino, C.: Graph polynomials and their applications ii: Interrelations and interpretations (2008)Google Scholar
- 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