The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem-Reference-Cited by-同舟云学术

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

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem

Published:2015-02 Issue: Volume:182 Page:15-24
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Dantas Simone,de Figueiredo Celina M.H.,Maffray Frédéric,Teixeira Rafael B.

Funder

Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference28 articles.

1. The pair completion algorithm for the homogeneous set sandwich problem;Bornstein;Inform. Process. Lett.,2006

2. Berge trigraphs;Chudnovsky;J. Graph Theory,2006

3. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006

4. Star-cutsets and perfect graphs;Chvátal;J. Combin. Theory Ser. B,1985

5. S.A. Cook, The complexity of theorem-proving procedures, in: Proc. of 3rd Annual ACM Symposium on Theory of Computing, 1971, pp. 151–158.

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

1. Some completion problems for graphs without chordless cycles of prescribed lengths;Discrete Applied Mathematics;2019-09

2. A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness;Electronic Notes in Theoretical Computer Science;2019-08

3. Sandwiches missing two ingredients of order four;Annals of Operations Research;2019-02-21

4. The (k,ℓ)partitioned probe problem: NP-complete versus polynomial dichotomy;Discrete Applied Mathematics;2018-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3