A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6477662 / rank
 
Normal rank
Property / zbMATH Keywords
 
constraint satisfaction problems
Property / zbMATH Keywords: constraint satisfaction problems / rank
 
Normal rank
Property / zbMATH Keywords
 
Max 2-CSP
Property / zbMATH Keywords: Max 2-CSP / rank
 
Normal rank
Property / zbMATH Keywords
 
treewidth
Property / zbMATH Keywords: treewidth / rank
 
Normal rank
Property / zbMATH Keywords
 
pathwidth
Property / zbMATH Keywords: pathwidth / rank
 
Normal rank

Revision as of 22:43, 30 June 2023

scientific article
Language Label Description Also known as
English
A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
scientific article

    Statements

    A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    constraint satisfaction problems
    0 references
    Max 2-CSP
    0 references
    treewidth
    0 references
    pathwidth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references