• Bài trích
  • Nhan đề: On Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs

Tác giả CN Wildman,Jeffrey
Nhan đề On Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs
Từ khóa tự do Connectivity
Từ khóa tự do giant component
Nguồn trích IEEE2016 Số: 4 Tập: 24
00000000nab#a2200000ui#4500
00131563
0026
00431C9652E-9AE9-4895-AF86-8DACEECE6FAA
005201909160922
008081223s vm| vie
0091 0
039|y20190916092308|zcuonglv
0410 |avie
100 |aWildman,Jeffrey
245 |aOn Characterizing the Local Pooling Factor of Greedy Maximal Scheduling in Random Graphs
653 |aConnectivity
653 |agiant component
773 |tIEEE|d2016|v24|i4
890|c1|a0|b0|d1
Không tìm thấy biểu ghi nào