Issue No.04 - July/August (2003 vol.15)
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.
Polynomials, Information retrieval, Computer science, Database languages, Testing, Hafnium, Equations
"The Subgraph Bisimulation Problem", IEEE Transactions on Knowledge & Data Engineering, vol.15, no. 4, pp. 1055,1056, July/August 2003, doi:10.1109/TKDE.2003.1209024