logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

The subgraph bisimulation problem

delete2003-07-01
delete15
delete
OA
AI
A
Agostino Dovier
C
Carla Piazza
DOI：10.1109/TKDE.2003.1209024delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

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.
Keywords:
bisimulation
complexity
semistructured data
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.8K
Citations:
3.2W

Organization

No organization information available