The Subgraph Bisimulation Problem

A. Dovier, C. Piazza
2003 IEEE Transactions on Knowledge and Data Engineering  
We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.
doi:10.1109/tkde.2003.1209024 fatcat:vmw6gqlyizdq7jhfu64pv3kxfi