Metric Dimension parameterized by treewidth is W[1]-hard, with no f(pw)n^{o(pw)} algorithm under ETH on constant-degree graphs.
20 Daniel Lokshtanov, Dániel Marx, and Saket Saurabh
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.
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.
-
An Overview of Universal Obstructions for Graph Parameters
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.