CSpace

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

限定条件    
已选(0)清除 条数/页:   排序方式:
A note on the L(2,1)-labelling problem of G(k, m) 期刊论文
DISCRETE APPLIED MATHEMATICS, 2022, 卷号: 322, 页码: 273-275
作者:  Ye, Qingjie
收藏  |  浏览/下载:34/0  |  提交时间:2023/02/07
Channel assignment  L(21)-labelling  
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2022, 页码: 28
作者:  Li, Jianping;  Wang, Wencheng;  Lichen, Junran;  Liu, Suding;  Pan, Pengxiang
收藏  |  浏览/下载:81/0  |  提交时间:2023/02/07
Combinatorial optimization  Locations of lines  Line-capacitated Steiner trees  Approximation algorithms  Exact algorithms  
The Distance Matching Extension in K-1,K-k-free Graphs with High Local Connectedness 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 卷号: 38, 期号: 1, 页码: 37-43
作者:  Liu, Wei-chan;  Yan, Gui-ying
收藏  |  浏览/下载:138/0  |  提交时间:2022/04/02
distance matching extension  perfect matching  K-1 k-free graph  local connectedness