Results 11 to 20 of about 918 (50)
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
Michael Q. Rieck +2 more
openalex +2 more sources
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
Mallikarjun Avula +2 more
openalex +1 more source
A matheuristic approach for solving the 2-connected dominating set problem
Raka Jovanović, Stefan Voß
openalex +1 more source
Randomized algorithms for approximating a Connected Dominating Set in Wireless Sensor Networks
Akshaye Dhawan +2 more
openalex +2 more sources
An $O(n)$-time algorithm to compute minimum $k$-hop connected dominating set of interval graphs
Sambhu Charan Barman +2 more
openalex +2 more sources
Minimum Connected Dominating Sets of Random Cubic Graphs [PDF]
William Duckworth
openalex +1 more source
Making a dominating set of a graph connected
Hengzhe Li, Baoyindureng Wu, Weihua Yang
openalex +1 more source
An extended localized algorithm for connected dominating set formation in ad hoc wireless networks [PDF]
Fei Dai, Jie Wu
openalex +1 more source

