A low degree vertex elimination with high degree vertex selection heuristic for strongly connected dominating and absorbent sets in wireless Ad-Hoc networks. (c2011)
In the Strongly Connected Dominating-Absorbent Set problem (SCDAS), we are given a directed graph and asked to find a subset D of vertices such that the subgraph induced by D is strongly connected and every vertex not in D has both an in-neighbor and an out-neighbor in D. SCDAS received attention re...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | masterThesis |
| منشور في: |
2016
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/3593 https://doi.org/10.26756/th.2011.59 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|