Linear-time algorithms for metric dimension on tree and unicyclic digraphs, FPT algorithm parameterized by directed modular-width, and NP-hardness on planar triangle-free acyclic digraphs of max degree 6.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Algorithms and hardness for Metric Dimension on digraphs
Linear-time algorithms for metric dimension on tree and unicyclic digraphs, FPT algorithm parameterized by directed modular-width, and NP-hardness on planar triangle-free acyclic digraphs of max degree 6.