tags:

views:

32

answers:

0
Q: 

Subgraph isomorphism on disconnected graphs with connection rules

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

related questions

What are the techniques for face detection on a bitmap?
Simple enough explanation of a Distributed Hash Table (DHT)
Could a truly random number be generated using pings to psuedo-randomly selected IP addresses?
Balancing a Binary Tree (AVL)
How do you handle small sets of data?
How to determine differences in two lists of data
"const correctness" in C#
Did you apply computational complexity theory in real life?
What's "P=NP?", and why is it such a famous question?
How does Jan Willem Klop's "(L L L...)" Y combinator work?
Big-O for Eight Year Olds?
What is a y-combinator?
How/When to abandon the use of Arrays in c#.net?
Hierarchical Group Permissions Theory/Resources?
Proving correctness of multithread algorithms
How to test randomness (case in point - Shuffling)
Recommended resources for computer science theory.
What is a DSL and where should I use it?
Coupling and cohesion
canonical problems list
What is the point of interfaces in PHP?
What is a lambda (function)?
What is Turing Complete?
Storing Images in DB - Yea or Nay?
How would you access Object properties from within an object method?