Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width (Q3557008): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104207136 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 March 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
