mCLP is NP-complete even on constant-size-tree forests with bounded levels or clusters, and FPT when parameterized by vertex cover number plus number of clusters.
Title resolution pending
1 Pith paper cite this work, alongside 25 external citations. Polarity classification is still indexing.
1
Pith paper citing it
25
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Monotone Clustered Level Planarity
mCLP is NP-complete even on constant-size-tree forests with bounded levels or clusters, and FPT when parameterized by vertex cover number plus number of clusters.