Enumerating induced s-t hyperpaths and minimal s-t separators in directed hypergraphs is not output-polynomial unless P=NP, and s-t hyperpath enumeration on BF-hypergraphs is at least as hard as the 45-year-old minimal transversal enumeration problem.
Linear time algorithms for liveness and boundedness in conflict-free petri nets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
Enumerating induced s-t hyperpaths and minimal s-t separators in directed hypergraphs is not output-polynomial unless P=NP, and s-t hyperpath enumeration on BF-hypergraphs is at least as hard as the 45-year-old minimal transversal enumeration problem.