A simple choice for traversing a graph are the traditional graph searching algorithms such as Breadth-First Search (BFS).
the graph searching procedure is likely to be incomplete (low recall), because simple string match is insufficient to match an effect to all its related entities, as it misses out in the case where an entity is semantically related but has a lexically different name.