---

Solution

In compiler design, loops in a flow graph are commonly identified using depth first ordering and back edges.

Dominators are also used because a loop header dominates the nodes inside the loop.

Reducible graphs are important in loop analysis because loops in reducible flow graphs can be identified systematically.

So, all three concepts are useful for identifying loops.