Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (Q884452)
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 5161875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem |
scientific article; zbMATH DE number 5161875 |
Statements
Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (English)
0 references
6 June 2007
0 references
partitioning problems
0 references
search space symmetry
0 references
graph coloring problem
0 references
landscape analysis
0 references
0.909672737121582
0 references
0.761845588684082
0 references
0.7449869513511658
0 references
0.7396655082702637
0 references
0.7350257635116577
0 references
