Geometric thickness admits fixed-parameter algorithms for vertex cover and feedback edge number, while the extension problem is FPT for missing edges but W[1]-hard or NP-hard once vertices are also missing.
Canadian Journal of Mathematics 17, 850–859 (1965)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pathways to Tractability for Geometric Thickness
Geometric thickness admits fixed-parameter algorithms for vertex cover and feedback edge number, while the extension problem is FPT for missing edges but W[1]-hard or NP-hard once vertices are also missing.