A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks 论文

2003Networks引用 333
DOI
Mobile Ad Hoc NetworksCooperative Communication and Network CodingComplexity and Algorithms in Graphs
Complexity and Algorithms in GraphsCooperative Communication and Network CodingMobile Ad Hoc Networks
相关技术:Mobile Ad Hoc NetworksCooperative Communication and Network CodingComplexity and Algorithms in Graphs
关系图谱

A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks · 相关文章

暂无数据