Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete-Reference-Cited by-同舟云学术

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

Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete

Published:2019-08 Issue: Volume:346 Page:545-556
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Jiménez Andrea,Schmidt Tina Janne

Funder

CONICYT/FONDECYT/INICIACION

CONICYT/PCI/REDES

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference9 articles.

1. An approach to the subgraph homeomorphism problem;Asano;Theoretical Computer Science,1985

2. Optimal binary space partitions in the plane;de Berg,2010

3. The subgraph homeomorphism problem for small wheels;Farr;Discrete Mathematics,1988

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. Finding topological subgraphs is fixed-parameter tractable;Grohe,2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP