Pages that link to "Item:Q4780532"
From MaRDI portal
The following pages link to An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532):
Displaying 6 items.
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- The interval-merging problem (Q867634) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
- The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
