Pages that link to "Item:Q1016039"
From MaRDI portal
The following pages link to On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039):
Displaying 11 items.
- Approximate event detection over multi-modal sensing data (Q346477) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- Liar's domination in unit disk graphs (Q2207495) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
