Pages that link to "Item:Q1675775"
From MaRDI portal
The following pages link to Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775):
Displaying 4 items.
- Making a dominating set of a graph connected (Q1656909) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks (Q3296835) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
