Geodetic Set can be solved in polynomial time on ditrees and in FPT time parameterized by feedback edge set on 2-cycle-free digraphs, but is NP-hard on DAGs with constant feedback vertex set and pathwidth.
In: Proceed- ings of the 10th Latin American Symposium on Theoretical Informatics (LATIN 2012)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Geodetic Set can be solved in polynomial time on ditrees and in FPT time parameterized by feedback edge set on 2-cycle-free digraphs, but is NP-hard on DAGs with constant feedback vertex set and pathwidth.