The P versus NP–complete dichotomy of some challenging problems in graph theory

Author:

de Figueiredo Celina M.H.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference70 articles.

1. Cliques and extended triangles. A necessary condition for planar clique graphs;Alcón;Discrete Appl. Math.,2004

2. The complexity of clique graph recognition;Alcón;Theoret. Comput. Sci.,2009

3. B. Aspvall, F.M. Plass, R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett., 8, 121–123.

4. Local conditions for edge-colouring of cographs;Barbosa;Congr. Numer.,1998

5. Topics on Perfect Graphs;Berge,1984

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

1. An Interactive Application for Learning and Analyzing Different Graph Vertex Cover Algorithms;International Journal of Engineering Pedagogy (iJEP);2023-02-16

2. Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy;International Journal of Foundations of Computer Science;2021-10-20

3. Disconnected cuts in claw-free graphs;Journal of Computer and System Sciences;2020-11

4. Hamiltonicity in Split Graphs - A Dichotomy;Algorithms and Discrete Applied Mathematics;2017

5. Optimizing combination of aircraft maintenance tasks by adaptive genetic algorithm based on cluster search;J SYST ENG ELECTRON;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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