Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673)
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 5279219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems |
scientific article; zbMATH DE number 5279219 |
Statements
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (English)
0 references
27 May 2008
0 references
0.8453015685081482
0 references
0.8423693776130676
0 references
0.84097820520401
0 references
0.8255555033683777
0 references
0.8253510594367981
0 references
