Pages that link to "Item:Q5963605"
From MaRDI portal
The following pages link to On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605):
Displaying 12 items.
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- Domination and outer connected domination in maximal outerplanar graphs (Q2053729) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747) (← links)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)
- Impact of diameter and convex ordering for Hamiltonicity and domination (Q6547831) (← links)
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)