An approach to the subgraph homeomorphism problem-Reference-Cited by-同舟云学术

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

An approach to the subgraph homeomorphism problem

Published:1985 Issue: Volume:38 Page:249-267
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Asano Takao

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference27 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. A linear time algorithm for the subgraph homeomorphism problem for the fixed graph K3,3;Asano,1983

3. Edge-deletion and edge-contraction problems;Asano,1982

4. Topology of series-parallel networks;Duffin;J. Math. Appl.,1965

5. Network flow and testing graph connectivity;Even;SIAM J. Comput.,1975

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

1. NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs;SIAM Journal on Computing;2021-01

2. Deciding whether a grid is a topological subgraph of a planar graph is NP-complete;Discrete Mathematics;2020-09

3. Deciding Whether a Grid is a Topological Subgraph of a Planar Graph is NP-Complete;Electronic Notes in Theoretical Computer Science;2019-08

4. NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs;The 31st ACM Symposium on Parallelism in Algorithms and Architectures;2019-06-17

5. Derandomizing Isolation Lemma for K-3,K-3-free and K-5 -free Bipartite Graphs;LEIBNIZ INT PR INFOR;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP