Average-case complexity of backtrack search for coloring sparse random graphs (Q394742)
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 6250822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-case complexity of backtrack search for coloring sparse random graphs |
scientific article; zbMATH DE number 6250822 |
Statements
Average-case complexity of backtrack search for coloring sparse random graphs (English)
0 references
27 January 2014
0 references
graph coloring
0 references
average-case complexity
0 references
search tree
0 references
random graphs
0 references
backtrack
0 references
0 references
0 references
0.8983446
0 references
0.8929744
0 references
0.89249873
0 references
0.87700963
0 references
0.87625736
0 references
