From matchings to independent sets-Reference-Cited by-同舟云学术

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

From matchings to independent sets

Published:2017-11 Issue: Volume:231 Page:4-14
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Lozin Vadim

Funder

EPSRC

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference34 articles.

1. Crown structures for vertex cover kernelization;Abu-Khzam;Theory Comput. Syst.,2007

2. The effect of local constraints on the complexity of determination of the graph independence number;Alekseev,1982

3. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math,2003

4. Polynomial algorithm for finding the largest independent sets in graphs without forks;Alekseev;Discrete Appl. Math.,2004

5. Augmenting graphs for independent sets;Alekseev;Discrete Appl. Math.,2004

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

1. Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Computing Subset Vertex Covers in H-Free Graphs;Fundamentals of Computation Theory;2023

3. New Results on Independent Sets in Extensions of $$2K_2$$-free Graphs;Graphs and Combinatorics;2022-07-29

4. Maximum weight independent sets for (S1,2,4,triangle)-free graphs in polynomial time;Theoretical Computer Science;2021-07

5. Independent Sets in ($$P_4+P_4$$,Triangle)-Free Graphs;Graphs and Combinatorics;2021-06-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP