The Subgraph Bisimulation Problem

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.

[1]  Letizia Tanca,et al.  G-Log: A Declarative Graphical Query Language , 1991, DOOD.

[2]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[3]  Elisa Quintarelli,et al.  Model-Checking Based Data Retrieval , 2004, Lecture Notes in Computer Science.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Robin Milner,et al.  Interpreting one Concurrent Calculus in Another , 1990, Theor. Comput. Sci..

[6]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[7]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[8]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  Alexei Lisitsa,et al.  Bounded Hyperset Theory and Web-like Data Bases , 1997, Kurt Gödel Colloquium.

[10]  Letizia Tanca,et al.  Operational and abstract semantics of the query language G-Log , 2002, Theor. Comput. Sci..

[11]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

[12]  Letizia Tanca,et al.  G-Log: A Graph-Based Query Language , 1995, IEEE Trans. Knowl. Data Eng..