Metric Dimension parameterized by treewidth is W[1]-hard, with no f(pw)n^{o(pw)} algorithm under ETH on constant-degree graphs.
11 Florent Foucaud, George B
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Metric Dimension Parameterized by Treewidth
Metric Dimension parameterized by treewidth is W[1]-hard, with no f(pw)n^{o(pw)} algorithm under ETH on constant-degree graphs.