Pages that link to "Item:Q2695276"
From MaRDI portal
The following pages link to On the approximation hardness of geodetic set and its variants (Q2695276):
Displaying 5 items.
- (Q4474203) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
- On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)