TY - GEN

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

AU - Furer, Martin

PY - 2010/6/18

Y1 - 2010/6/18

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77953483938&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953483938&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12200-2_6

DO - 10.1007/978-3-642-12200-2_6

M3 - Conference contribution

AN - SCOPUS:77953483938

SN - 3642121993

SN - 9783642121999

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 49

EP - 59

BT - LATIN 2010

T2 - 9th Latin American Theoretical Informatics Symposium, LATIN 2010

Y2 - 19 April 2010 through 23 April 2010

ER -