Pages that link to "Item:Q2338219"
From MaRDI portal
The following pages link to Algorithm and hardness results on hop domination in graphs (Q2338219):
Displaying 7 items.
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- On 2-step and hop dominating sets in graphs (Q2409527) (← links)
- ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES (Q5068502) (← links)
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
- Further results on the hop domination number of a graph (Q6596812) (← links)