Pages that link to "Item:Q495667"
From MaRDI portal
The following pages link to Finding outer-connected dominating sets in interval graphs (Q495667):
Displaying 3 items.
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)