Exploring the role of graph spectra in graph coloring algorithm performance (Q403572)
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: Exploring the role of graph spectra in graph coloring algorithm performance |
scientific article; zbMATH DE number 6336062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring the role of graph spectra in graph coloring algorithm performance |
scientific article; zbMATH DE number 6336062 |
Statements
Exploring the role of graph spectra in graph coloring algorithm performance (English)
0 references
29 August 2014
0 references
graph spectra
0 references
graph invariants
0 references
graph coloring
0 references
branch and bound
0 references
DSATUR
0 references
LP-relaxation
0 references
algorithm selection
0 references
0 references
0 references
0 references
0 references
0.7290432453155518
0 references
0.7196632623672485
0 references
0.7172303199768066
0 references
