Subgraph isomorphism on disconnected graphs with connection rules
- by Mac
Hello
I was wondering if anyone knows about a solution to the following problem:
Given a graph g as query and a set of graphs B with connection rules R. The connection rules describe how two graphs out of B can be linked together. Linking points are marked vertexes. Find all combination of graphs in B that contain g as a subgraph.
Regards
Mac