Reproduce “Decomposing Directed Graphs into Partial Orders is Hard” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Grzegorz Gutowski, Dominik Jilg, Antonio Lauerbach, Mikołaj Rams
The authors study covers and partitions of a directed acyclic graph’s arcs into strict partial orders, where each two-edge path requires its shortcut within a part. They prove both problems NP-complete for every fixed k≥2; for k≥3, hardness holds even when the underlying graph is triangle-free. Both problems are polynomial-time solvable for k=1, while k=2 is tractable on triangle-free DAGs.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.