On the complexity of diagram testing-Reference-Cited by-同舟云学术

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

On the complexity of diagram testing

Published:1993 Issue:4 Volume:10 Page:297-303
ISSN:0167-8094
Container-title:Order
language:en
Short-container-title:Order

Author:

Brightwell Graham

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/BF01108825.pdf

Reference11 articles.

1. M. R. Garey and D. S. Johnson (1979)Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman.

2. C. Lund and M. Yannakakis (1993) On the hardness of approximating minimization problems, in25th ACM Symposium on the Theory of Computing, pp. 286?293.

3. K. M. Mosesian (1972) Certain theorems on strongly basable graphs [Russian],Akad. Nauk Armian. SSR Dokl. 55, 83?86.

4. J. Ne?et?il and V. R�dl (1987) Complexity of diagrams,Order 3, 321?330.

5. J. Ne?et?il and V. R�dl, More on complexity of diagrams, submitted toOrder.

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

1. Maximum likelihood thresholds via graph rigidity;The Annals of Applied Probability;2024-06-01

2. Comparability Graphs Among Cover-Incomparability Graphs;Algorithms and Discrete Applied Mathematics;2022

3. Enumerating k-Arc-Connected Orientations;Algorithmica;2020-08-03

4. Outerstring Graphs are $\chi$-Bounded;SIAM Journal on Discrete Mathematics;2019-01

5. Word-Representable Graphs: a Survey;Journal of Applied and Industrial Mathematics;2018-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP