Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
2-Visits is strongly NP-complete for multiplicity 2 but in RP for constant distinct deadlines, with a 0.9142 density lower bound for 2-Visits and thresholds approaching 5/6 for large k.
citing papers explorer
-
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
-
Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
2-Visits is strongly NP-complete for multiplicity 2 but in RP for constant distinct deadlines, with a 0.9142 density lower bound for 2-Visits and thresholds approaching 5/6 for large k.