I am considering the following problem:
Input: 2 Graphs G=(V,E), H=(V',E'). G and H are directed multigraphs
Question: Find a subgraph in G which is isomorphic to H
- Is there any algorithm available for checking subgraph isomorphism in Multigraphs (specifically for multiple edge types) ?
- If yes, what is the complexity?