Document Open Access Logo

Structural Parameterizations of Geodetic Set on Directed (Acyclic) Graphs

Authors Laurent Beaudou , Florent Foucaud , Lucas Lorieau , Prafullkumar Tale

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2026.88.pdf
  • Filesize: 1.14 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Geodetic Set
  • Directed Graphs
  • NP-hardness
  • Parameterized Complexity

Metrics

Abstract

In Directed Geodetic Set, we are given a (directed) graph and seek a small solution set S ⊆ V(G) such that every vertex lies on a shortest directed path between two vertices in S. While most prior work on Directed Geodetic Set has focused on undirected graphs, in this article we study the problem on directed graphs from the perspective of parameterized complexity.
It is known that the problem is W[2]-hard when parameterized by the solution size k, even on directed acyclic graphs (DAGs). We investigate structural parameterizations of the problem.
Our first result is a kernel of size 2^O(vcn) for Directed Geodetic Set on general digraphs, where vcn denotes the vertex cover number of the underlying (undirected) graph. This implies an algorithm running in time 2^O(vcn²) ⋅ n^O(1). Furthermore, we prove that, assuming the ETH, the problem does not admit an algorithm running in time 2^o(vcn²) ⋅ n^O(1). Such a tight quadratic exponential lower bound in the parameter is relatively uncommon in parameterized complexity. These results generalize earlier work on undirected graphs by Foucaud et al. [STACS 2025], and complements a recent result on directed graph by Foucaud et al. [CALDAM 2026], that showed that the problem is para-NP-hard for the pathwidth and feedback vertex set number of the underlying graph.
Next, we show that on general digraphs, Directed Geodetic Set admits a natural kernel of size (kΔ)^O(rdiam), where Δ is the maximum degree and rdiam denotes the reachability diameter of the digraph (a natural analogue of diameter of undirected graphs). This yields an algorithm running in time (kΔ)^O(rdiam⋅k) ⋅ n^O(1). We further prove that, assuming the ETH, the problem does not admit an algorithm running in time (kΔ)^o(rdiam ⋅ k) ⋅ n^O(1). Finally, we justify the necessity of combining parameters by establishing the following hardness results for Directed Geodetic Set:  
1) It is W[2]-hard parameterized by k, even on digraphs of maximum degree 3. 
2) It is para-NP-hard parameterized by maximum degree and reachability diameter.  One can infer that the problem remains W[2]-hard when parameterized by k, even on graphs of reachability diameter 3 from Araújo and Arraes [DAM 2022]. 
All our conditional lower bounds and hardness results hold even when the input digraph is restricted to be a DAG.

Cite As Get BibTex

Laurent Beaudou, Florent Foucaud, Lucas Lorieau, and Prafullkumar Tale. Structural Parameterizations of Geodetic Set on Directed (Acyclic) Graphs. In 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 386, pp. 88:1-88:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.MFCS.2026.88

Author Details

Laurent Beaudou
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Florent Foucaud
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Lucas Lorieau
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Prafullkumar Tale
  • Indian Institute of Science Education and Research Pune, India

Funding

  • Foucaud, Florent: This author received support from the ANR project GRALMECO (ANR-21-CE48-0004), the French government IDEX-ISITE initiative 16-IDEX-0001 (CAP 20-25), the International Research Center "Innovation Transportation and Production Systems" of the I-SITE CAP 20-25, and the CNRS IRL ReLaX.
  • Lorieau, Lucas: This author has received financial support from the CNRS through the MITI interdisciplinary programs.
  • Tale, Prafullkumar: ARG-MATRICS Grant titled MaPLE (ARGM/2026/0089).

References

  1. J. Ahn, L. Jaffke, O. Kwon, and P. T. Lima. Well-partitioned chordal graphs. Discrete Mathematics, 345(10):112985, 2022. URL: https://doi.org/10.1016/J.DISC.2022.112985.
  2. J. Araújo and P. S. M. Arraes. Hull and geodetic numbers for some classes of oriented graphs. Discrete Applied Mathematics, 323:14-27, 2022. URL: https://doi.org/10.1016/J.DAM.2021.03.016.
  3. J. Araújo, M. C. Dourado, F. Protti, and R. M. Sampaio. Introduction to Graph Convexity: An Algorithmic Approach. Springer, 2025. Google Scholar
  4. B. Bals, J. Blikstad, D. Dadush, Y. Nazari, and J. Schmidt. Revisiting diameter in directed graphs. arXiv eprint, 2026. URL: https://arxiv.org/abs/2606.08217.
  5. L. Beaudou, F. Foucaud, L. Lorieau, and P. Tale. Structural parameterizations of geodetic set on directed (acyclic) graphs. arXiv eprint, 2026. URL: https://arxiv.org/abs/2606.26414.
  6. B. Bergougnoux, O. Defrain, and F. Mc Inerney. Enumerating minimal solution sets for metric graph problems. In WG 2024, volume 14760 of Lecture Notes in Computer Science, pages 50-64, 2024. URL: https://doi.org/10.1007/978-3-031-75409-8_4.
  7. D. Chakraborty, S. Das, F. Foucaud, H. Gahlawat, and D. Lajou. Algorithms and complexity for geodetic sets on interval and chordal graphs. Information and Computation, 311:105456, 2026. URL: https://doi.org/10.1016/J.IC.2026.105456.
  8. D. Chakraborty, S. Das, F. Foucaud, H. Gahlawat, D. Lajou, and B. Roy. Algorithms and complexity for geodetic sets on planar and chordal graphs. In ISAAC 2020, volume 181 of LIPIcs, pages 7:1-7:15, 2020. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2020.7.
  9. D. Chakraborty, F. Foucaud, H. Gahlawat, S. K. Ghosh, and B. Roy. Hardness and approximation for the geodetic set problem in some graph classes. In CALDAM 2020, volume 12016 of Lecture Notes in Computer Science, pages 102-115, 2020. URL: https://doi.org/10.1007/978-3-030-39219-2_9.
  10. D. Chakraborty, H. Gahlawat, and B. Roy. Algorithms and complexity for geodetic sets on partial grids. Theoretical Computer Science, 979:114217, 2023. URL: https://doi.org/10.1016/J.TCS.2023.114217.
  11. G. J. Chang, L. D. Tong, and H. T. Wang. Geodetic spectra of graphs. European Journal of Combinatorics, 25(3):383-391, 2004. URL: https://doi.org/10.1016/J.EJC.2003.09.010.
  12. G. Chartrand, J. F. Fink, and P. Zhang. The hull number of an oriented graph. International Journal of Mathematics and Mathematical Sciences, 2003(36):2265-2275, 2003. Google Scholar
  13. G. Chartrand and P. Zhang. The geodetic number of an oriented graph. European Journal of Combinatorics, 21(2):181-189, 2000. URL: https://doi.org/10.1006/EUJC.1999.0301.
  14. M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  15. T. Davot, L. Isenmann, and J. Thiebaut. On the approximation hardness of geodetic set and its variants. In COCOON 2021, volume 13025 of Lecture Notes in Computer Science, pages 76-88, 2021. URL: https://doi.org/10.1007/978-3-030-89543-3_7.
  16. L. Dong, C. Lu, and X. Wang. The upper and lower geodetic numbers of graphs. Ars Combinatoria, 91:401-409, 2009. Google Scholar
  17. M. C. Dourado, F. Protti, D. Rautenbach, and J. L. Szwarcfiter. Some remarks on the geodetic number of a graph. Discrete Mathematics, 310(4):832-837, 2010. URL: https://doi.org/10.1016/J.DISC.2009.09.018.
  18. T. Ekim, A. Erey, P. Heggernes, P. van’t Hof, and D. Meister. Computing minimum geodetic sets of proper interval graphs. In LATIN 2012, volume 7256 of Lecture Notes in Computer Science, pages 279-290, 2012. URL: https://doi.org/10.1007/978-3-642-29344-3_24.
  19. A. Farrugia. Orientable convexity, geodetic and hull numbers in graphs. Discrete Applied Mathematics, 148(3):256-262, 2005. URL: https://doi.org/10.1016/J.DAM.2005.03.002.
  20. F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Problems in np can admit double-exponential lower bounds when parameterized by treewidth or vertex cover. In ICALP 2024, volume 297 of LIPIcs, pages 66:1-66:19, 2024. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.66.
  21. F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Metric dimension and geodetic set parameterized by vertex cover. In STACS 2025, volume 327 of LIPIcs, pages 33:1-33:20, 2025. URL: https://doi.org/10.4230/LIPIcs.STACS.2025.33.
  22. F. Foucaud, N. Ghareghani, L. Lorieau, M. Mohammad Noori, R. Parvini Oskuei, and P. Tale. Algorithms and hardness for geodetic set on tree-like digraphs. In N. Misra and A. Pandey, editors, CALDAM 2026, volume 16445 of Lecture Notes in Computer Science, pages 179-193. Springer, 2026. URL: https://doi.org/10.1007/978-3-032-17156-6_14.
  23. F. Foucaud, B. Gras, A. Perez, and F. Sikora. On the complexity of broadcast domination and multipacking in digraphs. Algorithmica, 83(9):2651-2677, 2021. URL: https://doi.org/10.1007/S00453-021-00828-5.
  24. B. Haeupler, Y. Jiang, and T. Saranurak. Reducing shortcut and hopset constructions to shallow graphs. In S. Assadi and E. Rotenberg, editors, SOSA 2026, pages 385-393. SIAM, 2026. URL: https://doi.org/10.1137/1.9781611978964.30.
  25. F. Harary, E. Loukakis, and C. Tsouros. The geodetic number of a graph. Mathematical and Computer Modelling, 17(11):89-95, 1993. Google Scholar
  26. R. Impagliazzo and R. Paturi. Complexity of k-sat. In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, pages 237-240, 1999. Google Scholar
  27. L. Kellerhals and T. Koana. Parameterized complexity of geodetic set. Journal of Graph Algorithms and Applications, 26(4):401-419, 2022. URL: https://doi.org/10.7155/JGAA.00601.
  28. M. Lampis, N. Melissinos, and M. Vasilakis. Parameterized max min feedback vertex set. SIAM Journal on Discrete Mathematics, 39(3):1587-1620, 2025. URL: https://doi.org/10.1137/23M1605247.
  29. C. Lu. The geodetic numbers of graphs and digraphs. Science in China Series A: Mathematics, 50(8):1163-1172, 2007. Google Scholar
  30. M. Mezzini. Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Theoretical Computer Science, 745:63-74, 2018. URL: https://doi.org/10.1016/J.TCS.2018.05.032.
  31. I. M. Pelayo. Geodesic Convexity in Graphs. Springer, 2013. Google Scholar
  32. P. Tale. Geodetic set on graphs of constant pathwidth and feedback vertex set number. In A. Agrawal and E. Jan van Leeuwen, editors, IPEC 2025, volume 358 of LIPIcs, pages 28:1-28:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.IPEC.2025.28.
  33. C. A. Tovey. A simplified np-complete satisfiability problem. Discrete Applied Mathematics, 8(1):85-89, 1984. URL: https://doi.org/10.1016/0166-218X(84)90081-7.
  34. C. Wang, Y. Song, G. Fan, H. Jin, L. Su, F. Zhang, and X. Wang. Optimizing cross-line dispatching for minimum electric bus fleet. IEEE Transactions on Mobile Computing, 22(4):2307-2322, 2023. URL: https://doi.org/10.1109/TMC.2021.3119421.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact