Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width (Q3557008): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1159189 |
Changed an Item |
||
| Property / author | |||
| Property / author: Martin Fuerer / rank | |||
Normal rank | |||
Revision as of 15:56, 22 February 2024
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
