Explore relationships

Subgraph matching

In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphsG{\displaystyle G} and H{\displaystyle H} are given as input, and one must determine whether G{\displaystyle G} contains a subgraph that is isomorphic to H{\displaystyle H}.

Use + to expand a branch. Click a topic name to open its summary.