Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width (Q3557008)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width |
scientific article |
Statements
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width (English)
0 references
27 April 2010
0 references
chromatic polynomial
0 references
counting colorings
0 references
bounded tree-width
0 references
efficient algorithms
0 references
