Pages that link to "Item:Q4210228"
From MaRDI portal
The following pages link to <i>k</i>-Neighborhood-Covering and -Independence Problems for Chordal Graphs (Q4210228):
Displaying 5 items.
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532) (← links)
- Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
- The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
