CSpace

浏览/检索结果: 共2条,第1-2条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Algorithms for minimum m-connected k-tuple dominating set problem 期刊论文
THEORETICAL COMPUTER SCIENCE, 2007, 卷号: 381, 期号: 1-3, 页码: 241-247
作者:  Shang, Weiping;  Wan, Pengjun;  Yao, Frances;  Hu, Xiaodong
收藏  |  浏览/下载:126/0  |  提交时间:2018/07/30
connected dominating set  approximation algorithm  k-vertex connectivity  wireless sensor networks  
Routing algorithm for multicast under multi-tree model in optical networks 期刊论文
THEORETICAL COMPUTER SCIENCE, 2004, 卷号: 314, 期号: 1-2, 页码: 293-301
作者:  Gu, J;  Hu, XD;  Jia, XH;  Zhang, MH
收藏  |  浏览/下载:138/0  |  提交时间:2018/07/30
multicast  optical networks  routing  wavelength assignment  multi-tree model