Important Cuts with Logical Constraints: A Meta-Theorem for Eulerian Digraphs

arXiv:2611.19368 · cs.DS · Submitted 2026-11-14 · Read on arXiv

cs.DS

Submitted: 2026-11-14

Updated: 2026-11-14

Related papers