Efficient computation of the characteristic polynomial of a tree and related tasks

    Research output: Contribution to journalArticlepeer-review

    5 Scopus citations

    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.

    Original languageEnglish (US)
    Pages (from-to)626-642
    Number of pages17
    JournalAlgorithmica
    Volume68
    Issue number3
    DOIs
    StatePublished - Mar 2014

    All Science Journal Classification (ASJC) codes

    • Computer Science(all)
    • Computer Science Applications
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'Efficient computation of the characteristic polynomial of a tree and related tasks'. Together they form a unique fingerprint.

    Cite this