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 the normal view instead:
scientific article; zbMATH DE number 5702139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width |
scientific article; zbMATH DE number 5702139 |
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
0.8321893811225891
0 references
0.8297314643859863
0 references
0.8292974233627319
0 references
0.8200641870498657
0 references
