Block decomposition approach to compute a minimum geodetic set
RAIRO-Oper. Res., 48 4 (2014) 497-507
Published online: 2014-06-10
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the computational complexity of the strong geodetic recognition problem
Carlos V.G.C. Lima, Vinicius F. dos Santos, Joãao H.G. Sousa and Sebastián A. UrrutiaRAIRO - Operations Research 58 (5) 3755 (2024)
https://doi.org/10.1051/ro/2024120
Algorithms and complexity for geodetic sets on partial grids
Dibyayan Chakraborty, Harmender Gahlawat and Bodhayan RoyTheoretical Computer Science 979 114217 (2023)
https://doi.org/10.1016/j.tcs.2023.114217
Strong Geodetic Number of Graphs and Connectivity
Zhao Wang, Yaping Mao, Huifen Ge and Colton MagnantBulletin of the Malaysian Mathematical Sciences Society 43 (3) 2443 (2020)
https://doi.org/10.1007/s40840-019-00809-6
Algorithms and Discrete Applied Mathematics
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh and Bodhayan RoyLecture Notes in Computer Science, Algorithms and Discrete Applied Mathematics 12016 102 (2020)
https://doi.org/10.1007/978-3-030-39219-2_9
Strong geodetic problem on Cartesian products of graphs
Vesna Iršič and Sandi KlavžarRAIRO - Operations Research 52 (1) 205 (2018)
https://doi.org/10.1051/ro/2018003
Strong Geodetic Problem in Grid-Like Architectures
Sandi Klavžar and Paul ManuelBulletin of the Malaysian Mathematical Sciences Society 41 (3) 1671 (2018)
https://doi.org/10.1007/s40840-018-0609-x
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
Mauro MezziniTheoretical Computer Science 745 63 (2018)
https://doi.org/10.1016/j.tcs.2018.05.032
Strong Geodetic Number of Complete Bipartite Graphs and of Graphs with Specified Diameter
Vesna IršičGraphs and Combinatorics 34 (3) 443 (2018)
https://doi.org/10.1007/s00373-018-1885-9
Geodetic convexity parameters for (q,q−4)-graphs
Mitre C. Dourado, Lucia D. Penso and Dieter RautenbachDiscrete Applied Mathematics 223 64 (2017)
https://doi.org/10.1016/j.dam.2017.01.023
On the geodetic hull number of P-free graphs
Mitre C. Dourado, Lucia D. Penso and Dieter RautenbachTheoretical Computer Science 640 52 (2016)
https://doi.org/10.1016/j.tcs.2016.05.047