An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints-Reference-Cited by-同舟云学术

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

An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints

Published:2024-07 Issue: Volume:1005 Page:114628
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Kurita Kazuhiro^ORCID,Wasa Kunihiro

Publisher

Elsevier BV

Reference29 articles.

1. Dynamic enumeration of similarity joins;Agarwal,2021

2. Enumerating minimal weight set covers;Ajami,2019

3. Approximating the tree and tour covers of a graph;Arkin;Inf. Process. Lett.,1993

4. Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory;Baste,2020

5. Enumerating minimal dominating sets in Kt-free graphs and variants;Bonamy;ACM Trans. Algorithms,2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP