On Planar Valued CSPs

DOI10.4230/LIPICS.MFCS.2016.39MaRDI QIDQ4608600zbMATH OpenOpenAlexFDO

Authors Peter Fulla, S. Zivny

Publication date 21 March 2018

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.39

zbMATH Keywords

constraint satisfactionmultimorphismsplanaritypolymorphismsvalued constraint satisfaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• On planar valued CSPs
• On Planar Boolean CSP
• The complexity of valued CSPs
• The complexity of valued constraint satisfaction problems
• The complexity of conservative valued CSPs
• The complexity of conservative valued CSPs
• The complexity of general-valued CSPs
• Necessary conditions for tractability of valued CSPs

Cited in

(3)

• On planar valued CSPs
• On Planar Boolean CSP
• Hybrid tractable classes of constraint problems

This page was built for publication: On Planar Valued CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608600)