On the complexity of approximating the Hadwiger number-Reference-Cited by-同舟云学术

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

On the complexity of approximating the Hadwiger number

Published:2009-03 Issue:8-10 Volume:410 Page:994-996
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Wahlén Martin

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference3 articles.

1. Approximating the maximum clique minor and some subgraph homeomorphism problems;Alon;Theoretical Computer Science,2007

2. P. Berman, M. Karpinski, A.D. Scott, Approximation hardness and satisfiability of bounded occurrence instances of SAT, Electronic Colloquium on Computational Complexity, TR03-022, ISSN 1433-8092, April 2003 (submitted for publication)

3. D. Eppstein, Findling large clique minors is hard arXiv:0807.0007v1 [cs.DM] (submitted for publication)

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

1. Connected matchings in chordal bipartite graphs;Discrete Optimization;2014-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP