Subgraph isomorphism on disconnected graphs with connection rules
Posted
by Mac
on Stack Overflow
See other posts from Stack Overflow
or by Mac
Published on 2010-05-27T09:57:54Z
Indexed on
2010/05/27
10:01 UTC
Read the original article
Hit count: 282
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
© Stack Overflow or respective owner