Efficient subgraph isomorphism detection: a decomposition approach
نویسندگان
چکیده
منابع مشابه
Efficient Subgraph Isomorphism Detection: A Decomposition Approach
ÐGraphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we propose a new algorithm for subgraph isomorphism detection from a set of a priori known model graphs to an input graph that is given online. The new approach is based on a compact representation of the model graphs that is computed offline. Subgraphs that appear multiple...
متن کاملA constraint programming approach to subgraph isomorphism
ions for sets. Filtering and propagators A simple algorithm exists to find a solution to a CSP. A straightforward idea is to enumerate all assignments of the variables with respect to their domains, and check if the constraints are satisfied. This strategy is correct, but the time to find a solution is exponential. Individual constraints can be used to remove values. Values in the domain of a C...
متن کاملSubgraph Isomorphism Detection Using a Code Based Representation
Subgraph Isomorphism Detection is an important problem for several computer science subfields, where a graph-based representation is used. In this research we present a new approach to find a Subgraph Isomorphism (SI) using a list code based representation without candidate generation. We implement a step by step expansion model with a widthdepth search. Our experiments show a promising method ...
متن کاملA New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
In this paper, we propose a new algorithm for error-correcting subgraph isomorphism detection from a set of model graphs to an unknown input graph. The algorithm is based on a compact representation of the model graphs. This representation is derived from the set of model graphs in an off-line preprocessing step. The main advantage of the proposed representation is that common subgraphs of diff...
متن کاملBetween Subgraph Isomorphism and Maximum Common Subgraph
When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2000
ISSN: 1041-4347
DOI: 10.1109/69.842269