Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference7 articles.
1. The directed subgraph homeomorphism problem;Fortune;Theoret. Comput. Sci.,1980
2. Computers and Intractability;Garey,1979
3. A n52 algorithm for maximum matching in bipartite graphs;Hopcroft;J. SIAM Comput.,1973
4. The subgraph homeomorphism problems;LaPaugh,1978
5. An analysis of a good algorithm for the subtree problems;Reyner;SIAM J. Comput.,1977
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Theoretical Groundwork;Design Automation for Field-coupled Nanotechnologies;2021-10-21
2. Tree Isomorphism;Texts in Computer Science;2021
3. Efficient Frequent Subgraph Mining in Transactional Databases;2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA);2020-10
4. Efficient Frequent Subtree Mining Beyond Forests;DISS ARTIF INTELL;2020
5. Placement and Routing for Tile-based Field-coupled Nanocomputing Circuits Is
NP
-complete (Research Note);ACM Journal on Emerging Technologies in Computing Systems;2019-06-29