Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    An O(n log2 n) algorithm is presented to compute all coefficients of the chromatic polynomial of an n vertex graph of bounded tree-width. Previously, it has been known how to evaluate the chromatic polynomial for such graphs in linear time, implying a computation of all coefficients of the chromatic polynomial in quadratic time.

    Original languageEnglish (US)
    Title of host publicationLATIN 2010
    Subtitle of host publicationTheoretical Informatics - 9th Latin American Symposium, Proceedings
    Pages49-59
    Number of pages11
    DOIs
    StatePublished - Jun 18 2010
    Event9th Latin American Theoretical Informatics Symposium, LATIN 2010 - Oaxaca, Mexico
    Duration: Apr 19 2010Apr 23 2010

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume6034 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other9th Latin American Theoretical Informatics Symposium, LATIN 2010
    CountryMexico
    CityOaxaca
    Period4/19/104/23/10

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width'. Together they form a unique fingerprint.

  • Cite this

    Furer, M. (2010). Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width. In LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings (pp. 49-59). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6034 LNCS). https://doi.org/10.1007/978-3-642-12200-2_6