• Bài trích
  • Nhan đề: On Approximating Minimum 3-Connected -Dominating Set Problem in Unit Disk Graph

Tác giả CN Liu,Bei
Nhan đề On Approximating Minimum 3-Connected -Dominating Set Problem in Unit Disk Graph
Từ khóa tự do 3-connected -dominating set
Nguồn trích IEEE2016 Số: 5 Tập: 24
00000000nab#a2200000ui#4500
00131633
0026
004F3A2B56C-5737-4D60-A755-94F0491D3842
005201909171409
008081223s vm| vie
0091 0
039|a20190917140954|bcuonglv|y20190917091449|zcuonglv
0410 |avie
100 |aLiu,Bei
245 |aOn Approximating Minimum 3-Connected -Dominating Set Problem in Unit Disk Graph
653 |a3-connected -dominating set
773 |tIEEE|d2016|v24|i5
890|c1|a0|b0|d2
Không tìm thấy biểu ghi nào