Skip to Main Content
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 semistructured databases.
Knowledge and Data Engineering, IEEE Transactions on (Volume:15 , Issue: 4 )
Date of Publication: July-Aug. 2003