A tight bound on the number of mobile servers to guarantee transferability among dominating configurations-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

Published:2010-04 Issue:8 Volume:158 Page:913-920
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Fujita Satoshi

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference20 articles.

1. Finding a minimum independent dominating set in a permutation graph;Atallah;Discrete Applied Mathematics,1988

2. Efficient dominating sets in graphs;Bange,1988

3. On the domatic number of interval graphs;Bertossi;Information Processing Letters,1988

4. Weighted independent perfect domination on cocomparability graphs;Chang,1993

5. Optimal domination in graphs;Cockayne;IEEE Transactions on Circuits and Systems,1975

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transferable domination number of graphs;Discrete Applied Mathematics;2022-05

2. Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs;Discrete Applied Mathematics;2019-04

3. Worst Case Analysis of Approximation Algorithm of Abrams et al. for the Set k-Cover Problem;IEICE Transactions on Information and Systems;2014

4. Distributed Algorithm for Set K-Cover Problem and its Worst Case Analysis;2012 Third International Conference on Networking and Computing;2012-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP