A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789)
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: A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP |
scientific article; zbMATH DE number 6477662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP |
scientific article; zbMATH DE number 6477662 |
Statements
A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (English)
0 references
2 September 2015
0 references
constraint satisfaction problems
0 references
Max 2-CSP
0 references
treewidth
0 references
pathwidth
0 references
0 references
0 references
0.88178724
0 references
0.88178724
0 references
0.8805476
0 references
0 references
0.8669888
0 references
0.86531126
0 references
0.86245877
0 references
0.8617482
0 references
0 references
