Algorithm to find a maximum 2-packing set in a cactus-Reference-Cited by-同舟云学术

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

Algorithm to find a maximum 2-packing set in a cactus

Published:2018-05 Issue: Volume:725 Page:31-51
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Flores-Lamas Alejandro^ORCID,Fernández-Zepeda José Alberto,Trejo-Sánchez Joel Antonio^ORCID

Funder

CONACYT

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference44 articles.

1. Solving NP-hard problems on graphs that are almost trees and an application to facility location problems;Gurevich;J. ACM,1984

2. A best possible heuristic for the k-center problem;Hochbaum;Math. Oper. Res.,1985

3. k-Packings and k-Domination on Tree Graphs;Mjelde,2004

4. Maximum Independent Set and Related Problems, with Applications;Butenko,2003

5. Frequency assignment: theory and applications;Hale;Proc. IEEE,1980

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

1. A fast approximation algorithm for the maximum 2-packing set problem on planar graphs;Optimization Letters;2022-10-11

2. A distributed algorithm for a maximal 2-packing set in Halin graphs;Journal of Parallel and Distributed Computing;2020-08

3. A GENETIC ALGORITHM FOR THE MAXIMUM 2-PACKING SET PROBLEM;INT J AP MAT COM-POL;2020

4. Fast Random Cactus Graph Generation;Communications in Computer and Information Science;2018-12-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP