Are unique subgraphs not easier to find?

Information Processing Letters（2018）

引用 1|浏览31

暂无评分

摘要

•A counterexample to claimed bounds for subgraph isomorphism in terms of those when a graph contains ≤1 pattern copies.•A new time bound for subgraph isomorphism in terms of that when a graph contains ≤1 pattern copies.•A new time bound for induced subgraph isomorphism in terms of that when a graph contains ≤1 pattern copies.

查看译文

关键词

Algorithms,Subgraph isomorphism,Induced subgraph isomorphism,Unique subgraph occurrence,Time complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要