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
I will report recent progress on the formula complexity of the (colorful) subgraph isomorphism probl...
In different application fields, such as biology, databases, social networks and so on, graphs are a...
Finding subgraph isomorphisms is an important problem in many applications which deal with data mode...
Similarity is a well known weakening of bisimilarity where one system is required to simulate the ot...
AbstractWe investigate the computational complexity of the following restricted variant of Subgraph ...
The subgraph isomorphism problem involves deciding whether a copy of a pattern graph occurs inside a...
International audienceThe subgraph isomorphism problem involves deciding whether a copy of a pattern...
This project introduces history and basic notions of the graph theory. It describes graph theory pro...
Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as...
This thesis builds upon the result that a lot of graph classes - namely classes with bounded expansi...
This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic ope...
Some applications of graph and subgraph isomorphism are discussed, particular consideration being gi...
We study the non-uniform complexity of the Graph Isomorphism (GI) and Graph Automorphism (GA) proble...
International audienceSubgraph isomorphism search is a basic task in querying graph data. It consist...
AbstractWe present a clear demarcation between classes of bounded tree-width graphs for which the su...
I will report recent progress on the formula complexity of the (colorful) subgraph isomorphism probl...
In different application fields, such as biology, databases, social networks and so on, graphs are a...
Finding subgraph isomorphisms is an important problem in many applications which deal with data mode...
Similarity is a well known weakening of bisimilarity where one system is required to simulate the ot...
AbstractWe investigate the computational complexity of the following restricted variant of Subgraph ...
The subgraph isomorphism problem involves deciding whether a copy of a pattern graph occurs inside a...
International audienceThe subgraph isomorphism problem involves deciding whether a copy of a pattern...
This project introduces history and basic notions of the graph theory. It describes graph theory pro...
Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as...
This thesis builds upon the result that a lot of graph classes - namely classes with bounded expansi...
This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic ope...
Some applications of graph and subgraph isomorphism are discussed, particular consideration being gi...
We study the non-uniform complexity of the Graph Isomorphism (GI) and Graph Automorphism (GA) proble...
International audienceSubgraph isomorphism search is a basic task in querying graph data. It consist...
AbstractWe present a clear demarcation between classes of bounded tree-width graphs for which the su...
I will report recent progress on the formula complexity of the (colorful) subgraph isomorphism probl...
In different application fields, such as biology, databases, social networks and so on, graphs are a...
Finding subgraph isomorphisms is an important problem in many applications which deal with data mode...
DOI
Add to ORKG