Pages that link to "Item:Q779181"

The following pages link to Hardness and approximation for the geodetic set problem in some graph classes (Q779181):

Displayed 7 items.

• 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)
• Parameterized Complexity of Geodetic Set (Q5050005) ‎ (← links)
• Algorithms and complexity for geodetic sets on partial grids (Q6057850) ‎ (← links)
• (Q6065396) ‎ (← links)
• Parameterized Complexity of Geodetic Set (Q6089667) ‎ (← links)