返回
The subgraph bisimulation problem
DOI:10.1109/TKDE.2003.1209024.png)
摘要
En 中文
We study the complexity of the Subgraph Bisimulation Problem, which relates to Graph Bisimulation as Subgraph Isomorphism relates to Graph Isomorphism, and we prove its NP-Completeness. Our analysis is motivated by its applications to sernistructured databases.
Keyword:
bisimulation
complexity
semistructured data
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
7.0K
被引数:
4.1W
机构
暂无机构信息
引用论文
没有更多内容

