Exact algorithms for counting 3-colorings of graphs (Q2081467)
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: Exact algorithms for counting 3-colorings of graphs |
scientific article; zbMATH DE number 7600621
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for counting 3-colorings of graphs |
scientific article; zbMATH DE number 7600621 |
Statements
Exact algorithms for counting 3-colorings of graphs (English)
0 references
13 October 2022
0 references
exact exponential-time algorithms
0 references
branch and reduce
0 references
measure and conquer
0 references
dynamic programming
0 references
