CORC

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

已选(0)清除 条数/页:   排序方式:
On Approximating Minimum 3-Connected m-Dominating Set Problem in Unit Disk Graph 期刊论文
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 卷号: 24, 期号: [db:dc_citation_issue], 页码: 2722-2733
作者:  Liu, Bei;  Wang, Wei;  Kim, Donghyun;  Li, Deying;  Wang, Jingyi
收藏  |  浏览/下载:4/0  |  提交时间:2019/12/02
A Better Constant Approximation for Minimum 3-connected m-dominating Set Problem in Unit Disk Graph using Tutte Decomposition 会议论文
作者:  Wang, Wei;  Liu, Bei;  Kim, Donghyun;  Li, Deying;  Wang, Jingyi
收藏  |  浏览/下载:4/0  |  提交时间:2019/12/02
A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks 会议论文
IEEE INFOCOM 2010, San Diego, CA, United states, March 14, 2010 - March 19, 2010
作者:  Kim, Donghyun;  Wang, Wei;  Li, Xianyue;  Zhang, Zhao;  Wu, Weili
收藏  |  浏览/下载:3/0  |  提交时间:2017/01/20
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
收藏  |  浏览/下载:10/0  |  提交时间:2018/07/30
On distance connected domination numbers of graphs 期刊论文
ARS COMBINATORIA, 2007, 卷号: 84, 页码: 357-367
作者:  Tian, Fang;  Xu, Jun-Ming
收藏  |  浏览/下载:2/0  |  提交时间:2019/08/22
Distance-dominating cycles in quasi claw-free graphs 期刊论文
GRAPHS AND COMBINATORICS, 1999, 卷号: 15, 期号: 3, 页码: 279-285
作者:  Chen, CP;  Harkat-Benhamdine, A;  Li, H
收藏  |  浏览/下载:16/0  |  提交时间:2018/07/30


©版权所有 ©2017 CSpace - Powered by CSpace