Vertex splitting into cographs, P_t-free, chordal, and unit-interval graphs is NP-complete under all studied variants, with no 2^{o(k)} algorithms unless ETH fails.
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes
1 Pith paper cite this work, alongside 24 external citations. Polarity classification is still indexing.
1
Pith paper citing it
24
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hardness of Vertex Splitting: Cographs, Chordal Graphs, and Beyond
Vertex splitting into cographs, P_t-free, chordal, and unit-interval graphs is NP-complete under all studied variants, with no 2^{o(k)} algorithms unless ETH fails.