Block decomposition approach to compute a minimum geodetic set
From MaRDI portal
Publication:2928426
DOI10.1051/ro/2014019zbMath1301.05100OpenAlexW2147243846MaRDI QIDQ2928426
Publication date: 7 November 2014
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2014__48_4_497_0/
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
On the geodetic hull number of \(P_{k}\)-free graphs ⋮ Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ Strong geodetic number of graphs and connectivity ⋮ Strong geodetic problem in grid-like architectures ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ Strong geodetic problem on complete multipartite graphs ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
This page was built for publication: Block decomposition approach to compute a minimum geodetic set
