Pages that link to "Item:Q2928426"
From MaRDI portal
The following pages link to Block decomposition approach to compute a minimum geodetic set (Q2928426):
Displaying 12 items.
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- Strong geodetic problem on Cartesian products of graphs (Q4579894) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)