Approximating the chromatic polynomial (Q2799869)
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: Approximating the chromatic polynomial |
scientific article; zbMATH DE number 6568619
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the chromatic polynomial |
scientific article; zbMATH DE number 6568619 |
Statements
13 April 2016
0 references
broken circuit algorithm
0 references
falling factorial algorithm
0 references
Approximating the chromatic polynomial (English)
0 references
The authors present two algorithms that approximate the coefficients of the classic chromatic polynomial of (random) graphs with relatively large orders. One of their algorithms is an improvement of the common broken circuit algorithm while the other, the falling factorial algorithm, is faster with low errors when compared to those of Li's and Knuth's.
0 references
