WorksComputer Science
Important Cuts with Logical Constraints: A Meta-Theorem for Eulerian Digraphs
Abstract
Important separators are a standard tool in parameterized cut algorithms. An - separator is important if it is inclusion-wise minimal and no separator of at most the same size leaves a strict superset of the vertices reachable from after deletion. Their use relies on a boundedness theorem: for fixed , the number of important - separators of size at most is at most a constant ( to be precise) independent of the input size, even in directed graphs, and they can be enumerated efficiently. The classical theory, however, controls only the size of the separator, not the structure of the source side cut off by it. Once the source side is required to satisfy a condition such as acyclicity, bipartiteness, or another logical property, the corresponding maximal source sides can be unbounded in general digraphs. This obstruction is fundamentally related to hardness phenomena in directed deletion problems such as Directed Odd Cycle Transversal}. Prior to this work, even in undirected graphs, boundedness of such maximal constrained source sides was known only in more specialized settings, not at the level of generality considered in our work.