-
1
A low degree vertex elimination with high degree vertex selection heuristic for strongly connected dominating and absorbent sets in wireless Ad-Hoc networks. (c2011)
منشور في 2016"…We introduce a new heuristic approach based on a hybrid of low-degree vertex elimination and high-degree vertex selection. …"
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
2
Genetic and heuristic algorithms for regrouping service sites. (c2000)
منشور في 2000احصل على النص الكامل
احصل على النص الكامل
masterThesis -
3
A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks
منشور في 2017"…We introduce a hybrid heuristic for this problem, in which we combine low-degree vertex elimination and high-degree vertex selection. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject
