Block decomposition approach to compute a minimum geodetic set
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1086005
- scientific article; zbMATH DE number 3931054
- Algorithms and complexity for geodetic sets on partial grids
- Computing minimum geodetic sets of proper interval graphs
- Computational Complexity of Geodetic Set
- Bounds and algorithms for geodetic hulls
- Balanced incomplete block design and the construction of geodetic blocks
- Parameterized complexity of geodetic set
- Parameterized Complexity of Geodetic Set
- Minimization of GNSS geometric factors
Cited in
(12)- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Strong geodetic number of graphs and connectivity
- Geodetic convexity parameters for \((q, q - 4)\)-graphs
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- On the geodetic hull number of \(P_{k}\)-free graphs
- Geodetic convexity parameters for graphs with few short induced paths
- Strong geodetic problem on Cartesian products of graphs
- Strong geodetic problem on complete multipartite graphs
- Algorithms and complexity for geodetic sets on partial grids
- On the computational complexity of the strong geodetic recognition problem
- Strong geodetic problem in grid-like architectures
This page was built for publication: Block decomposition approach to compute a minimum geodetic set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928426)
