We only have this paper's title and publication details.
Read it at the sourceAnswers are grounded in this paper and cite their sources.
Analysis reveals algorithmic hardness of geodetic sets in tree-like digraphs, indicating potential computational challenges.
International audience
No takes yet. Share an insight, caveat, or question.
Lekshmi et al. (2026) studied this question.