Minimum Power Dominating Sets of Random Cubic Graphs

Author:

Kang Liying1,Wormald Nicholas2

Affiliation:

1. DEPARTMENT OF MATHEMATICS; SHANGHAI UNIVERSITY; SHANGHAI CHINA

2. SCHOOL OF MATHEMATICAL SCIENCES; MONASH UNIVERSITY; VIC AUSTRALIA

Funder

National Natural Science Foundation of China

Canada Research Chairs program

Natural Sciences and Engineering Research Council of Canada

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference19 articles.

1. A. Aazami Hardness results and approximation algorithms for some problems on graphs 2009

2. Approximation algorithm and hardness for domination with propagation;Aazami;SIAM J Discrete Math,2009

3. Minimum independent dominating sets of random cubic graphs;Duckworth;Random Struct Algor,2002

4. A threshold of lnn for approximating set cover;Feige;J ACM,1998

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

1. Design an MCH Vertical Handover for Mobile IoT to Minimise the Delay and Compared with Conventional RSS;2022 11th International Conference on System Modeling & Advancement in Research Trends (SMART);2022-12-16

2. Algorithms and Complexity of Power Domination in Graphs;Developments in Mathematics;2020-09-15

3. Power Domination in Graphs;Topics in Domination in Graphs;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3