The Subgraph Bisimulation Problem

Authors:
Agostino Dovier;Carla Piazza
Affiliations:
-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2003

Citing 0
Cited 8

Model-Checking Based Data Retrieval

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Applying model-checking to solve queries on semistructured data

Computer Languages, Systems and Structures
Combining Two Structured Domains for Modeling Various Graph Matching Problems

Recent Advances in Constraints
Querying structural and behavioral properties of business processes

DBPL'07 Proceedings of the 11th international conference on Database programming languages
Capturing topology in graph pattern matching

Proceedings of the VLDB Endowment
A structural/temporal query language for Business Processes

Journal of Computer and System Sciences
Graph pattern matching revised for social network analysis

Proceedings of the 15th International Conference on Database Theory
Strong simulation: Capturing topology in graph pattern matching

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.