Finding happiness: An analysis of the maximum happy vertices problem-Reference-Cited by-同舟云学术

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

Finding happiness: An analysis of the maximum happy vertices problem

Published:2019-03 Issue: Volume:103 Page:265-276
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

R. Lewis^ORCID,D. Thiruvady,K. Morgan^ORCID

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference18 articles.

1. On the parameterized complexity of happy vertex coloring;Agrawal,2018

2. Algorithm source code, 2018. http://www.rhydlewis.eu/resources/happyalgs.zip. Accessed 2018-11-14.

3. Linear time algorithms for happy vertex coloring problems for trees;Aravind,2016

4. Algorithms and hardness results for happy coloring problems;Aravind;CoRR,2017

5. Network Science;Barabási,2016

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

1. Extension of CMSA with a Learning Mechanism: Application to the Far from Most String Problem;International Journal of Computational Intelligence Systems;2024-04-29

2. Multi-constructor CMSA for the maximum disjoint dominating sets problem;Computers & Operations Research;2024-01

3. Introduction to CMSA;Computational Intelligence Methods and Applications;2024

4. Simple Heuristics for the Rooted Max Tree Coverage Problem;Combinatorial Optimization and Applications;2023-12-09

5. Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem;Expert Systems with Applications;2023-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP