Even delta-matroids and the complexity of planar Boolean CSPs Conference Paper

Author(s): Kazda, Alexandr; Kolmogorov, Vladimir; Rolinek, Michal
Title: Even delta-matroids and the complexity of planar Boolean CSPs
Affiliation IST Austria
Abstract: The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary.
Conference Title: SODA: Symposium on Discrete Algorithms
Conference Dates: January 16 - January 19, 2017
Conference Location: Barcelona, Spain
ISBN: 1557-9468
Publisher: SIAM  
Date Published: 2017-01-01
Start Page: 307
End Page: 326
Sponsor: European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160
DOI: 10.1137/1.9781611974782.20
Open access: yes (repository)
IST Austria Authors
  1. Alexandr Kazda
    3 Kazda
Related IST Austria Work