Disk scaling is proposed as a parameterized graph modification operation, with subexponential FPT algorithms, polynomial kernels, EPTASes, and NP-hardness results for shrinking to independence, acyclicity, and connectivity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parameterized Geometric Graph Modification with Disk Scaling
Disk scaling is proposed as a parameterized graph modification operation, with subexponential FPT algorithms, polynomial kernels, EPTASes, and NP-hardness results for shrinking to independence, acyclicity, and connectivity.