Author:
Shi Feng,You Jie,Zhang Zhen,Liu Jingyi,Wang Jianxin
Funder
National Natural Science Foundation of China
Science and Technology Program of Gansu Province
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Tractabilities for tree assembly problems;Shi,2020
2. Subgraph isomorphism in planar graphs and related problems;Eppstein,2002
3. Computers and Intractability: a Guide to the Theory of NP-Completeness;Garey,2002
4. Subgraph isomorphism for biconnected outerplanar graphs in cubic time;Lingas;Theor. Comput. Sci.,1989
5. On the complexity of finding iso- and other morphisms for partial k-trees;Matoušek;Discrete Math.,1992