Pages that link to "Item:Q1786594"
From MaRDI portal
The following pages link to Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594):
Displaying 6 items.
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
