A substructure based lower bound for eternal vertex cover number-Reference-Cited by-同舟云学术

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

A substructure based lower bound for eternal vertex cover number

Published:2021-10 Issue: Volume:890 Page:87-104
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Babu Jasine,Prabhakaran Veena,Sharma Arko

Funder

University of Haifa

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. Edge protection in graphs;Klostermeyer;Australas. J. Comb.,2009

2. F.V. Fomin, S. Gaspers, P.A. Golovach, D. Kratsch, S. Saurabh, 2009, Unpublished manuscript, personal communication.

3. Parameterized algorithm for eternal vertex cover;Fomin;Inf. Process. Lett.,2010

4. The eternal dominating set problem for interval graphs;Rinemberg;Inf. Process. Lett.,2019

5. Tight bounds for eternal dominating sets in graphs;Goldwasser;Discrete Math.,2008

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

1. Stability of Vertex Covers in a Game with Finitely Many Steps;Journal of Applied and Industrial Mathematics;2024-06

2. Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms;Lecture Notes in Computer Science;2024

3. Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs;WALCOM: Algorithms and Computation;2023

4. Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game;Optimization and Applications;2023

5. Eternal Vertex Cover on Bipartite Graphs;Computer Science – Theory and Applications;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP