Pages that link to "Item:Q2118246"
From MaRDI portal
The following pages link to An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246):
Displaying 5 items.
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Strong edge geodetic problem on grids (Q2239003) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS (Q5075633) (← links)
- On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)