Minimally unsatisfiable 2-CNFs correspond to weak double cycles having at most one skew-symmetry, giving quadratic-time isomorphism and Theta(n^{3k-1}) types for deficiency k.
Fernandez de La Vega
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
citing papers explorer
-
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
Minimally unsatisfiable 2-CNFs correspond to weak double cycles having at most one skew-symmetry, giving quadratic-time isomorphism and Theta(n^{3k-1}) types for deficiency k.
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.