Pages that link to "Item:Q2102897"
From MaRDI portal
The following pages link to A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897):
Displaying 6 items.
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs (Q1661898) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
- More on the complexity of defensive domination in graphs (Q6657275) (← links)