Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430)
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: Backtrack: An O(1) expected time algorithm for the graph coloring problem |
scientific article; zbMATH DE number 3860387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Backtrack: An O(1) expected time algorithm for the graph coloring problem |
scientific article; zbMATH DE number 3860387 |
Statements
Backtrack: An O(1) expected time algorithm for the graph coloring problem (English)
0 references
1984
0 references
graph coloring
0 references
average complexity
0 references
backtrack algorithm
0 references
0.9177109599113464
0 references
0.8430920243263245
0 references
0.8276730179786682
0 references
0.8075557351112366
0 references
